./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi008.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi008.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:46:23,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:46:24,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:46:24,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:46:24,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:46:24,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:46:24,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:46:24,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:46:24,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:46:24,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:46:24,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:46:24,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:46:24,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:46:24,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:46:24,039 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:46:24,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:46:24,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:46:24,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:46:24,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:46:24,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:46:24,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:46:24,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:46:24,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:46:24,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:46:24,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:46:24,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:46:24,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:46:24,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:46:24,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:46:24,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:46:24,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:46:24,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:46:24,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:46:24,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:46:24,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:46:24,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:46:24,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:46:24,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:46:24,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:46:24,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:46:24,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:46:24,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:46:24,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:46:24,047 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 [2024-06-28 01:46:24,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:46:24,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:46:24,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:46:24,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:46:24,271 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:46:24,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2024-06-28 01:46:25,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:46:25,576 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:46:25,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2024-06-28 01:46:25,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536654415/ea8fe649be034ab98b1c56be2a445e75/FLAGbda0c0d06 [2024-06-28 01:46:25,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536654415/ea8fe649be034ab98b1c56be2a445e75 [2024-06-28 01:46:25,598 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:46:25,599 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:46:25,599 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-nonrel/rfi008.oepc.yml/witness.yml [2024-06-28 01:46:25,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:46:25,728 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:46:25,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:46:25,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:46:25,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:46:25,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:46:25" (1/2) ... [2024-06-28 01:46:25,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6903d8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:46:25, skipping insertion in model container [2024-06-28 01:46:25,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:46:25" (1/2) ... [2024-06-28 01:46:25,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b9457eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:46:25, skipping insertion in model container [2024-06-28 01:46:25,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:46:25" (2/2) ... [2024-06-28 01:46:25,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6903d8d2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:25, skipping insertion in model container [2024-06-28 01:46:25,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:46:25" (2/2) ... [2024-06-28 01:46:25,739 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:46:25,791 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:46:25,793 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) [2024-06-28 01:46:25,793 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) [2024-06-28 01:46:25,793 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:46:25,793 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-28 01:46:25,832 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:46:25,948 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] [2024-06-28 01:46:26,100 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:46:26,113 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:46:26,145 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i[988,1001] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:46:26,237 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:46:26,266 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:46:26,266 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26 WrapperNode [2024-06-28 01:46:26,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:46:26,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:46:26,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:46:26,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:46:26,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,307 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-06-28 01:46:26,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:46:26,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:46:26,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:46:26,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:46:26,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,336 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 01:46:26,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:46:26,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:46:26,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:46:26,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:46:26,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (1/1) ... [2024-06-28 01:46:26,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:46:26,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:46:26,371 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 01:46:26,392 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 01:46:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:46:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:46:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:46:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:46:26,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:46:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:46:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:46:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:46:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:46:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:46:26,407 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 01:46:26,525 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:46:26,527 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:46:26,777 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:46:26,777 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:46:26,960 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:46:26,960 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:46:26,961 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:46:26 BoogieIcfgContainer [2024-06-28 01:46:26,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:46:26,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:46:26,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:46:26,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:46:26,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:46:25" (1/4) ... [2024-06-28 01:46:26,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cf5078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:46:26, skipping insertion in model container [2024-06-28 01:46:26,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:46:25" (2/4) ... [2024-06-28 01:46:26,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cf5078 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:46:26, skipping insertion in model container [2024-06-28 01:46:26,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:46:26" (3/4) ... [2024-06-28 01:46:26,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cf5078 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:46:26, skipping insertion in model container [2024-06-28 01:46:26,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:46:26" (4/4) ... [2024-06-28 01:46:26,972 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2024-06-28 01:46:26,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:46:26,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:46:26,985 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:46:27,016 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:46:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:46:27,056 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-28 01:46:27,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:46:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-28 01:46:27,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:46:27,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-28 01:46:27,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:46:27,071 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;@4f5d9b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:46:27,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:46:27,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:46:27,074 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:46:27,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:46:27,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:27,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:46:27,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:27,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 351384175, now seen corresponding path program 1 times [2024-06-28 01:46:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110667415] [2024-06-28 01:46:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:27,755 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 01:46:27,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110667415] [2024-06-28 01:46:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110667415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:27,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:46:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651565450] [2024-06-28 01:46:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:27,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:46:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:46:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:46:27,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:46:27,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:27,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:27,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:46:27,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:28,033 INFO L124 PetriNetUnfolderBase]: 475/961 cut-off events. [2024-06-28 01:46:28,033 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 01:46:28,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 961 events. 475/961 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5428 event pairs, 334 based on Foata normal form. 36/899 useless extension candidates. Maximal degree in co-relation 1766. Up to 787 conditions per place. [2024-06-28 01:46:28,040 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 30 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 01:46:28,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 167 flow [2024-06-28 01:46:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:46:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:46:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-28 01:46:28,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6936936936936937 [2024-06-28 01:46:28,050 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 77 transitions. [2024-06-28 01:46:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 167 flow [2024-06-28 01:46:28,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:28,054 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-28 01:46:28,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 01:46:28,057 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:46:28,057 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-28 01:46:28,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:28,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:28,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:46:28,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:46:28,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:28,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 351384258, now seen corresponding path program 1 times [2024-06-28 01:46:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682261459] [2024-06-28 01:46:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:28,099 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 01:46:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682261459] [2024-06-28 01:46:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682261459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:46:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718806751] [2024-06-28 01:46:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:28,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:46:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:46:28,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:46:28,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 37 [2024-06-28 01:46:28,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:28,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:28,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 37 [2024-06-28 01:46:28,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:28,194 INFO L124 PetriNetUnfolderBase]: 219/526 cut-off events. [2024-06-28 01:46:28,195 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-28 01:46:28,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 526 events. 219/526 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2984 event pairs, 130 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 969. Up to 340 conditions per place. [2024-06-28 01:46:28,197 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-06-28 01:46:28,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 173 flow [2024-06-28 01:46:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:46:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:46:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-28 01:46:28,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7477477477477478 [2024-06-28 01:46:28,199 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 83 transitions. [2024-06-28 01:46:28,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 173 flow [2024-06-28 01:46:28,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:46:28,200 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-06-28 01:46:28,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-28 01:46:28,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:46:28,202 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-06-28 01:46:28,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:28,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:28,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:28,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:46:28,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:28,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1622136343, now seen corresponding path program 1 times [2024-06-28 01:46:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:28,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767005855] [2024-06-28 01:46:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:28,676 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 01:46:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767005855] [2024-06-28 01:46:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767005855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:46:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695104654] [2024-06-28 01:46:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:28,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:46:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:46:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:46:28,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:46:28,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:28,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:28,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:46:28,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:28,840 INFO L124 PetriNetUnfolderBase]: 342/721 cut-off events. [2024-06-28 01:46:28,840 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-06-28 01:46:28,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 721 events. 342/721 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3826 event pairs, 218 based on Foata normal form. 2/693 useless extension candidates. Maximal degree in co-relation 1459. Up to 562 conditions per place. [2024-06-28 01:46:28,844 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 34 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-28 01:46:28,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 218 flow [2024-06-28 01:46:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:46:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:46:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-28 01:46:28,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-06-28 01:46:28,848 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 92 transitions. [2024-06-28 01:46:28,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 218 flow [2024-06-28 01:46:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:28,851 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-28 01:46:28,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-28 01:46:28,852 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-28 01:46:28,852 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-28 01:46:28,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:28,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:28,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:28,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:46:28,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:28,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1253381954, now seen corresponding path program 1 times [2024-06-28 01:46:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:28,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368634376] [2024-06-28 01:46:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:29,559 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 01:46:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368634376] [2024-06-28 01:46:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368634376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:29,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:46:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471394341] [2024-06-28 01:46:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:29,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:46:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:29,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:46:29,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:46:29,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:46:29,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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 01:46:29,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:29,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:46:29,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:29,775 INFO L124 PetriNetUnfolderBase]: 342/732 cut-off events. [2024-06-28 01:46:29,775 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-06-28 01:46:29,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 732 events. 342/732 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3926 event pairs, 180 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 1611. Up to 547 conditions per place. [2024-06-28 01:46:29,778 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 41 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-06-28 01:46:29,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 289 flow [2024-06-28 01:46:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:46:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:46:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-28 01:46:29,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6162162162162163 [2024-06-28 01:46:29,780 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 114 transitions. [2024-06-28 01:46:29,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 289 flow [2024-06-28 01:46:29,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 282 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:46:29,781 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 163 flow [2024-06-28 01:46:29,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-28 01:46:29,782 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2024-06-28 01:46:29,782 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 163 flow [2024-06-28 01:46:29,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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 01:46:29,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:29,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:29,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:46:29,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:29,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash 191499997, now seen corresponding path program 1 times [2024-06-28 01:46:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552806265] [2024-06-28 01:46:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:30,956 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 01:46:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552806265] [2024-06-28 01:46:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552806265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:46:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618273055] [2024-06-28 01:46:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:30,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:46:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:46:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:46:31,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:46:31,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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 01:46:31,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:31,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:46:31,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:31,296 INFO L124 PetriNetUnfolderBase]: 406/839 cut-off events. [2024-06-28 01:46:31,296 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-06-28 01:46:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 839 events. 406/839 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4533 event pairs, 159 based on Foata normal form. 2/808 useless extension candidates. Maximal degree in co-relation 1985. Up to 621 conditions per place. [2024-06-28 01:46:31,299 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 56 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-28 01:46:31,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 404 flow [2024-06-28 01:46:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-28 01:46:31,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868725868725869 [2024-06-28 01:46:31,301 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 163 flow. Second operand 7 states and 152 transitions. [2024-06-28 01:46:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 404 flow [2024-06-28 01:46:31,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 382 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 01:46:31,303 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 202 flow [2024-06-28 01:46:31,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-06-28 01:46:31,304 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-06-28 01:46:31,304 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 202 flow [2024-06-28 01:46:31,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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 01:46:31,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:31,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:46:31,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:31,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash -339406244, now seen corresponding path program 1 times [2024-06-28 01:46:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918023124] [2024-06-28 01:46:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:31,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 01:46:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:31,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918023124] [2024-06-28 01:46:31,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918023124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:31,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:46:31,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734037525] [2024-06-28 01:46:31,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:31,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:46:31,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:31,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:46:31,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:46:31,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:31,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:31,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:31,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:32,035 INFO L124 PetriNetUnfolderBase]: 559/1100 cut-off events. [2024-06-28 01:46:32,035 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2024-06-28 01:46:32,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1100 events. 559/1100 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5914 event pairs, 170 based on Foata normal form. 1/1059 useless extension candidates. Maximal degree in co-relation 2773. Up to 908 conditions per place. [2024-06-28 01:46:32,040 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 44 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2024-06-28 01:46:32,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 340 flow [2024-06-28 01:46:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:46:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:46:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-28 01:46:32,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-06-28 01:46:32,041 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 202 flow. Second operand 5 states and 88 transitions. [2024-06-28 01:46:32,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 340 flow [2024-06-28 01:46:32,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 315 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:32,044 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 209 flow [2024-06-28 01:46:32,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-28 01:46:32,044 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2024-06-28 01:46:32,044 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 209 flow [2024-06-28 01:46:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:32,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:32,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:46:32,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:32,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1641533739, now seen corresponding path program 1 times [2024-06-28 01:46:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274143000] [2024-06-28 01:46:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:33,348 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 01:46:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274143000] [2024-06-28 01:46:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274143000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858688607] [2024-06-28 01:46:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:33,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:33,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:46:33,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 209 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:33,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:33,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:46:33,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:33,821 INFO L124 PetriNetUnfolderBase]: 449/907 cut-off events. [2024-06-28 01:46:33,821 INFO L125 PetriNetUnfolderBase]: For 1157/1157 co-relation queries the response was YES. [2024-06-28 01:46:33,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 907 events. 449/907 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4899 event pairs, 136 based on Foata normal form. 4/877 useless extension candidates. Maximal degree in co-relation 2370. Up to 652 conditions per place. [2024-06-28 01:46:33,825 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 61 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2024-06-28 01:46:33,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 453 flow [2024-06-28 01:46:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:46:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:46:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-28 01:46:33,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709459459459459 [2024-06-28 01:46:33,826 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 209 flow. Second operand 8 states and 169 transitions. [2024-06-28 01:46:33,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 453 flow [2024-06-28 01:46:33,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 439 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 01:46:33,829 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 227 flow [2024-06-28 01:46:33,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-06-28 01:46:33,829 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2024-06-28 01:46:33,829 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 227 flow [2024-06-28 01:46:33,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:33,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:33,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:33,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:46:33,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:33,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1963832210, now seen corresponding path program 1 times [2024-06-28 01:46:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372208609] [2024-06-28 01:46:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:34,318 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 01:46:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372208609] [2024-06-28 01:46:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372208609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:46:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174091923] [2024-06-28 01:46:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:34,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:46:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:34,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:46:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:46:34,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:34,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:34,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:34,670 INFO L124 PetriNetUnfolderBase]: 553/1064 cut-off events. [2024-06-28 01:46:34,670 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2024-06-28 01:46:34,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2925 conditions, 1064 events. 553/1064 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5651 event pairs, 159 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 2903. Up to 866 conditions per place. [2024-06-28 01:46:34,675 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 51 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-28 01:46:34,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 401 flow [2024-06-28 01:46:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:46:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:46:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-28 01:46:34,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:46:34,677 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 227 flow. Second operand 6 states and 105 transitions. [2024-06-28 01:46:34,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 401 flow [2024-06-28 01:46:34,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 369 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:46:34,679 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 232 flow [2024-06-28 01:46:34,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-06-28 01:46:34,680 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2024-06-28 01:46:34,680 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 232 flow [2024-06-28 01:46:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:34,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:34,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:34,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:46:34,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:34,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash -277824696, now seen corresponding path program 1 times [2024-06-28 01:46:34,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736307490] [2024-06-28 01:46:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:35,224 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 01:46:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736307490] [2024-06-28 01:46:35,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736307490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:35,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:35,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:46:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824419079] [2024-06-28 01:46:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:35,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:46:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:46:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:46:35,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:35,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:35,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:35,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:35,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:35,507 INFO L124 PetriNetUnfolderBase]: 589/1143 cut-off events. [2024-06-28 01:46:35,507 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2024-06-28 01:46:35,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1143 events. 589/1143 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6148 event pairs, 305 based on Foata normal form. 1/1106 useless extension candidates. Maximal degree in co-relation 3142. Up to 929 conditions per place. [2024-06-28 01:46:35,512 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 55 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-06-28 01:46:35,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 484 flow [2024-06-28 01:46:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:46:35,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44787644787644787 [2024-06-28 01:46:35,513 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 232 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:46:35,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 484 flow [2024-06-28 01:46:35,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 458 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:35,517 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 328 flow [2024-06-28 01:46:35,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-06-28 01:46:35,518 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-06-28 01:46:35,518 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 328 flow [2024-06-28 01:46:35,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:35,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:35,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:35,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:46:35,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:35,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 218676620, now seen corresponding path program 2 times [2024-06-28 01:46:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692728553] [2024-06-28 01:46:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:35,922 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 01:46:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:35,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692728553] [2024-06-28 01:46:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692728553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:46:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951718480] [2024-06-28 01:46:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:46:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:46:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:46:35,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:35,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:35,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:35,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:35,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:36,300 INFO L124 PetriNetUnfolderBase]: 618/1207 cut-off events. [2024-06-28 01:46:36,300 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2024-06-28 01:46:36,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 1207 events. 618/1207 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6641 event pairs, 272 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 3589. Up to 946 conditions per place. [2024-06-28 01:46:36,306 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 65 selfloop transitions, 29 changer transitions 0/101 dead transitions. [2024-06-28 01:46:36,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 727 flow [2024-06-28 01:46:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-28 01:46:36,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826254826254826 [2024-06-28 01:46:36,307 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 328 flow. Second operand 7 states and 125 transitions. [2024-06-28 01:46:36,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 727 flow [2024-06-28 01:46:36,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 709 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-28 01:46:36,311 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 551 flow [2024-06-28 01:46:36,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-06-28 01:46:36,313 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-06-28 01:46:36,314 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 551 flow [2024-06-28 01:46:36,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:36,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:36,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:46:36,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:36,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash 282012748, now seen corresponding path program 3 times [2024-06-28 01:46:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148822942] [2024-06-28 01:46:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:36,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 01:46:36,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148822942] [2024-06-28 01:46:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148822942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:46:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39318396] [2024-06-28 01:46:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:46:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:46:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:46:36,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:36,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 551 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:36,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:36,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:36,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:37,186 INFO L124 PetriNetUnfolderBase]: 616/1208 cut-off events. [2024-06-28 01:46:37,187 INFO L125 PetriNetUnfolderBase]: For 3359/3359 co-relation queries the response was YES. [2024-06-28 01:46:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4003 conditions, 1208 events. 616/1208 cut-off events. For 3359/3359 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6690 event pairs, 300 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 3970. Up to 992 conditions per place. [2024-06-28 01:46:37,194 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 70 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2024-06-28 01:46:37,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 774 flow [2024-06-28 01:46:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-28 01:46:37,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 01:46:37,197 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 551 flow. Second operand 7 states and 111 transitions. [2024-06-28 01:46:37,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 774 flow [2024-06-28 01:46:37,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 745 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:37,204 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 567 flow [2024-06-28 01:46:37,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2024-06-28 01:46:37,205 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2024-06-28 01:46:37,205 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 567 flow [2024-06-28 01:46:37,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:37,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:37,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:37,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:46:37,206 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:37,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -460374061, now seen corresponding path program 1 times [2024-06-28 01:46:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126788434] [2024-06-28 01:46:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:37,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:37,895 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 01:46:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126788434] [2024-06-28 01:46:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126788434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443187231] [2024-06-28 01:46:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:37,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:37,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:37,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:37,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:37,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:38,383 INFO L124 PetriNetUnfolderBase]: 652/1332 cut-off events. [2024-06-28 01:46:38,383 INFO L125 PetriNetUnfolderBase]: For 3843/3843 co-relation queries the response was YES. [2024-06-28 01:46:38,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4351 conditions, 1332 events. 652/1332 cut-off events. For 3843/3843 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7687 event pairs, 258 based on Foata normal form. 1/1275 useless extension candidates. Maximal degree in co-relation 4316. Up to 945 conditions per place. [2024-06-28 01:46:38,392 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 89 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2024-06-28 01:46:38,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 1130 flow [2024-06-28 01:46:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:46:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:46:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:46:38,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-06-28 01:46:38,394 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 567 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:46:38,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 1130 flow [2024-06-28 01:46:38,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 1090 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:38,405 INFO L231 Difference]: Finished difference. Result has 83 places, 101 transitions, 846 flow [2024-06-28 01:46:38,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=83, PETRI_TRANSITIONS=101} [2024-06-28 01:46:38,407 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2024-06-28 01:46:38,407 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 101 transitions, 846 flow [2024-06-28 01:46:38,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:38,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:38,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:38,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:46:38,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:38,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1844349267, now seen corresponding path program 2 times [2024-06-28 01:46:38,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:38,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640917354] [2024-06-28 01:46:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:39,048 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 01:46:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640917354] [2024-06-28 01:46:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640917354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:39,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989785241] [2024-06-28 01:46:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:39,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:39,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 101 transitions, 846 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:39,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:39,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:39,463 INFO L124 PetriNetUnfolderBase]: 725/1424 cut-off events. [2024-06-28 01:46:39,463 INFO L125 PetriNetUnfolderBase]: For 5433/5433 co-relation queries the response was YES. [2024-06-28 01:46:39,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5372 conditions, 1424 events. 725/1424 cut-off events. For 5433/5433 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8318 event pairs, 280 based on Foata normal form. 1/1373 useless extension candidates. Maximal degree in co-relation 5334. Up to 1043 conditions per place. [2024-06-28 01:46:39,477 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 84 selfloop transitions, 56 changer transitions 0/147 dead transitions. [2024-06-28 01:46:39,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 147 transitions, 1415 flow [2024-06-28 01:46:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:46:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:46:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 01:46:39,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2024-06-28 01:46:39,478 INFO L175 Difference]: Start difference. First operand has 83 places, 101 transitions, 846 flow. Second operand 8 states and 143 transitions. [2024-06-28 01:46:39,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 147 transitions, 1415 flow [2024-06-28 01:46:39,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 1360 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:39,488 INFO L231 Difference]: Finished difference. Result has 90 places, 120 transitions, 1125 flow [2024-06-28 01:46:39,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1125, PETRI_PLACES=90, PETRI_TRANSITIONS=120} [2024-06-28 01:46:39,489 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-06-28 01:46:39,490 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 120 transitions, 1125 flow [2024-06-28 01:46:39,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:46:39,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:39,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -737872950, now seen corresponding path program 1 times [2024-06-28 01:46:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536694699] [2024-06-28 01:46:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:39,964 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 01:46:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536694699] [2024-06-28 01:46:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536694699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:39,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:39,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253502263] [2024-06-28 01:46:39,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:39,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:40,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:40,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 120 transitions, 1125 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:40,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:40,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:40,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:40,492 INFO L124 PetriNetUnfolderBase]: 779/1536 cut-off events. [2024-06-28 01:46:40,492 INFO L125 PetriNetUnfolderBase]: For 6957/6957 co-relation queries the response was YES. [2024-06-28 01:46:40,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 1536 events. 779/1536 cut-off events. For 6957/6957 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9155 event pairs, 285 based on Foata normal form. 3/1478 useless extension candidates. Maximal degree in co-relation 5986. Up to 1115 conditions per place. [2024-06-28 01:46:40,506 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 112 selfloop transitions, 43 changer transitions 0/162 dead transitions. [2024-06-28 01:46:40,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 162 transitions, 1638 flow [2024-06-28 01:46:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:46:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:46:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:46:40,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:46:40,508 INFO L175 Difference]: Start difference. First operand has 90 places, 120 transitions, 1125 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:46:40,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 162 transitions, 1638 flow [2024-06-28 01:46:40,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 162 transitions, 1577 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:40,522 INFO L231 Difference]: Finished difference. Result has 96 places, 131 transitions, 1264 flow [2024-06-28 01:46:40,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1264, PETRI_PLACES=96, PETRI_TRANSITIONS=131} [2024-06-28 01:46:40,523 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-28 01:46:40,523 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 131 transitions, 1264 flow [2024-06-28 01:46:40,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:40,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:40,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:46:40,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:40,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -771114157, now seen corresponding path program 3 times [2024-06-28 01:46:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971252273] [2024-06-28 01:46:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:41,167 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 01:46:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971252273] [2024-06-28 01:46:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971252273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130622359] [2024-06-28 01:46:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:41,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:41,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:41,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 131 transitions, 1264 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:41,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:41,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:41,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:41,630 INFO L124 PetriNetUnfolderBase]: 787/1546 cut-off events. [2024-06-28 01:46:41,631 INFO L125 PetriNetUnfolderBase]: For 8188/8188 co-relation queries the response was YES. [2024-06-28 01:46:41,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 1546 events. 787/1546 cut-off events. For 8188/8188 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9245 event pairs, 279 based on Foata normal form. 1/1486 useless extension candidates. Maximal degree in co-relation 6626. Up to 1194 conditions per place. [2024-06-28 01:46:41,695 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 108 selfloop transitions, 45 changer transitions 0/160 dead transitions. [2024-06-28 01:46:41,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 160 transitions, 1717 flow [2024-06-28 01:46:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:46:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:46:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 01:46:41,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:46:41,697 INFO L175 Difference]: Start difference. First operand has 96 places, 131 transitions, 1264 flow. Second operand 8 states and 140 transitions. [2024-06-28 01:46:41,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 160 transitions, 1717 flow [2024-06-28 01:46:41,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 160 transitions, 1669 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:41,709 INFO L231 Difference]: Finished difference. Result has 102 places, 135 transitions, 1368 flow [2024-06-28 01:46:41,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1368, PETRI_PLACES=102, PETRI_TRANSITIONS=135} [2024-06-28 01:46:41,711 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2024-06-28 01:46:41,711 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 135 transitions, 1368 flow [2024-06-28 01:46:41,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:41,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:41,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:41,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:46:41,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:41,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash -905922289, now seen corresponding path program 4 times [2024-06-28 01:46:41,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953150571] [2024-06-28 01:46:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:42,477 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 01:46:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953150571] [2024-06-28 01:46:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953150571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:42,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:42,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:42,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036172741] [2024-06-28 01:46:42,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:42,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:42,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:42,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 135 transitions, 1368 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:42,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:42,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:42,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:42,880 INFO L124 PetriNetUnfolderBase]: 811/1616 cut-off events. [2024-06-28 01:46:42,880 INFO L125 PetriNetUnfolderBase]: For 9137/9137 co-relation queries the response was YES. [2024-06-28 01:46:42,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1616 events. 811/1616 cut-off events. For 9137/9137 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9669 event pairs, 254 based on Foata normal form. 1/1549 useless extension candidates. Maximal degree in co-relation 6946. Up to 1093 conditions per place. [2024-06-28 01:46:42,891 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 80 selfloop transitions, 81 changer transitions 0/168 dead transitions. [2024-06-28 01:46:42,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 168 transitions, 1904 flow [2024-06-28 01:46:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:46:42,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942084942084942 [2024-06-28 01:46:42,893 INFO L175 Difference]: Start difference. First operand has 102 places, 135 transitions, 1368 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:46:42,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 168 transitions, 1904 flow [2024-06-28 01:46:42,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 168 transitions, 1818 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:46:42,911 INFO L231 Difference]: Finished difference. Result has 103 places, 143 transitions, 1546 flow [2024-06-28 01:46:42,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1546, PETRI_PLACES=103, PETRI_TRANSITIONS=143} [2024-06-28 01:46:42,912 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-06-28 01:46:42,912 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 143 transitions, 1546 flow [2024-06-28 01:46:42,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:42,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:42,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:42,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:46:42,913 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:42,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -22630159, now seen corresponding path program 5 times [2024-06-28 01:46:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703163301] [2024-06-28 01:46:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:43,612 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 01:46:43,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:43,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703163301] [2024-06-28 01:46:43,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703163301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:43,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:43,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769441727] [2024-06-28 01:46:43,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:43,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:43,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:43,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:43,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:43,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 143 transitions, 1546 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:43,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:43,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:43,960 INFO L124 PetriNetUnfolderBase]: 842/1664 cut-off events. [2024-06-28 01:46:43,960 INFO L125 PetriNetUnfolderBase]: For 10760/10760 co-relation queries the response was YES. [2024-06-28 01:46:43,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7639 conditions, 1664 events. 842/1664 cut-off events. For 10760/10760 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10180 event pairs, 283 based on Foata normal form. 1/1597 useless extension candidates. Maximal degree in co-relation 7590. Up to 1250 conditions per place. [2024-06-28 01:46:43,969 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 111 selfloop transitions, 58 changer transitions 0/176 dead transitions. [2024-06-28 01:46:43,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 176 transitions, 2110 flow [2024-06-28 01:46:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-28 01:46:43,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749034749034749 [2024-06-28 01:46:43,972 INFO L175 Difference]: Start difference. First operand has 103 places, 143 transitions, 1546 flow. Second operand 7 states and 123 transitions. [2024-06-28 01:46:43,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 176 transitions, 2110 flow [2024-06-28 01:46:43,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 176 transitions, 2027 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:43,989 INFO L231 Difference]: Finished difference. Result has 106 places, 153 transitions, 1743 flow [2024-06-28 01:46:43,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1743, PETRI_PLACES=106, PETRI_TRANSITIONS=153} [2024-06-28 01:46:43,990 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-28 01:46:43,990 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 153 transitions, 1743 flow [2024-06-28 01:46:43,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:43,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:43,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:43,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:46:43,991 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:43,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -22629942, now seen corresponding path program 2 times [2024-06-28 01:46:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869759018] [2024-06-28 01:46:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:44,581 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 01:46:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869759018] [2024-06-28 01:46:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869759018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831257545] [2024-06-28 01:46:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:44,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:44,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 153 transitions, 1743 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:44,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:44,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:44,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:45,015 INFO L124 PetriNetUnfolderBase]: 925/1830 cut-off events. [2024-06-28 01:46:45,015 INFO L125 PetriNetUnfolderBase]: For 10799/10799 co-relation queries the response was YES. [2024-06-28 01:46:45,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 1830 events. 925/1830 cut-off events. For 10799/10799 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11438 event pairs, 304 based on Foata normal form. 3/1754 useless extension candidates. Maximal degree in co-relation 8192. Up to 1260 conditions per place. [2024-06-28 01:46:45,026 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 133 selfloop transitions, 52 changer transitions 0/192 dead transitions. [2024-06-28 01:46:45,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 192 transitions, 2357 flow [2024-06-28 01:46:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-28 01:46:45,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019305019305019 [2024-06-28 01:46:45,032 INFO L175 Difference]: Start difference. First operand has 106 places, 153 transitions, 1743 flow. Second operand 7 states and 130 transitions. [2024-06-28 01:46:45,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 192 transitions, 2357 flow [2024-06-28 01:46:45,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 192 transitions, 2235 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:45,048 INFO L231 Difference]: Finished difference. Result has 108 places, 160 transitions, 1803 flow [2024-06-28 01:46:45,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1803, PETRI_PLACES=108, PETRI_TRANSITIONS=160} [2024-06-28 01:46:45,048 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2024-06-28 01:46:45,048 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 160 transitions, 1803 flow [2024-06-28 01:46:45,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:45,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:45,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:46:45,049 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:45,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1013404721, now seen corresponding path program 6 times [2024-06-28 01:46:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798807113] [2024-06-28 01:46:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:45,676 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 01:46:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798807113] [2024-06-28 01:46:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798807113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975884976] [2024-06-28 01:46:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:45,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:45,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:45,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 160 transitions, 1803 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:45,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:45,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:45,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:46,106 INFO L124 PetriNetUnfolderBase]: 923/1795 cut-off events. [2024-06-28 01:46:46,106 INFO L125 PetriNetUnfolderBase]: For 10837/10837 co-relation queries the response was YES. [2024-06-28 01:46:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8335 conditions, 1795 events. 923/1795 cut-off events. For 10837/10837 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11023 event pairs, 338 based on Foata normal form. 1/1726 useless extension candidates. Maximal degree in co-relation 8284. Up to 1451 conditions per place. [2024-06-28 01:46:46,118 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 145 selfloop transitions, 27 changer transitions 0/179 dead transitions. [2024-06-28 01:46:46,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 179 transitions, 2239 flow [2024-06-28 01:46:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 01:46:46,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517374517374517 [2024-06-28 01:46:46,133 INFO L175 Difference]: Start difference. First operand has 108 places, 160 transitions, 1803 flow. Second operand 7 states and 117 transitions. [2024-06-28 01:46:46,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 179 transitions, 2239 flow [2024-06-28 01:46:46,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 179 transitions, 2171 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:46,149 INFO L231 Difference]: Finished difference. Result has 111 places, 160 transitions, 1805 flow [2024-06-28 01:46:46,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1805, PETRI_PLACES=111, PETRI_TRANSITIONS=160} [2024-06-28 01:46:46,150 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-06-28 01:46:46,150 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 160 transitions, 1805 flow [2024-06-28 01:46:46,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:46,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:46,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:46,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:46:46,151 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:46,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -897671112, now seen corresponding path program 3 times [2024-06-28 01:46:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081605165] [2024-06-28 01:46:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:46,735 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 01:46:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081605165] [2024-06-28 01:46:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081605165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463363180] [2024-06-28 01:46:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:46,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:46,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:46,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 160 transitions, 1805 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:46,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:46,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:46,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:47,182 INFO L124 PetriNetUnfolderBase]: 977/1918 cut-off events. [2024-06-28 01:46:47,182 INFO L125 PetriNetUnfolderBase]: For 11055/11055 co-relation queries the response was YES. [2024-06-28 01:46:47,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8671 conditions, 1918 events. 977/1918 cut-off events. For 11055/11055 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12076 event pairs, 346 based on Foata normal form. 3/1842 useless extension candidates. Maximal degree in co-relation 8619. Up to 1444 conditions per place. [2024-06-28 01:46:47,194 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 161 selfloop transitions, 29 changer transitions 0/197 dead transitions. [2024-06-28 01:46:47,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 2436 flow [2024-06-28 01:46:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-28 01:46:47,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2024-06-28 01:46:47,195 INFO L175 Difference]: Start difference. First operand has 111 places, 160 transitions, 1805 flow. Second operand 7 states and 124 transitions. [2024-06-28 01:46:47,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 197 transitions, 2436 flow [2024-06-28 01:46:47,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 197 transitions, 2294 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-28 01:46:47,211 INFO L231 Difference]: Finished difference. Result has 111 places, 165 transitions, 1781 flow [2024-06-28 01:46:47,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1781, PETRI_PLACES=111, PETRI_TRANSITIONS=165} [2024-06-28 01:46:47,211 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-06-28 01:46:47,211 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 165 transitions, 1781 flow [2024-06-28 01:46:47,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:47,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:47,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:47,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:46:47,212 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:47,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1752087380, now seen corresponding path program 4 times [2024-06-28 01:46:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475246944] [2024-06-28 01:46:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:47,632 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 01:46:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475246944] [2024-06-28 01:46:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475246944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:46:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407328125] [2024-06-28 01:46:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:46:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:46:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:46:47,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:47,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 165 transitions, 1781 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:47,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:47,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:47,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:48,033 INFO L124 PetriNetUnfolderBase]: 971/1883 cut-off events. [2024-06-28 01:46:48,033 INFO L125 PetriNetUnfolderBase]: For 10933/10933 co-relation queries the response was YES. [2024-06-28 01:46:48,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 1883 events. 971/1883 cut-off events. For 10933/10933 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11680 event pairs, 347 based on Foata normal form. 3/1813 useless extension candidates. Maximal degree in co-relation 8485. Up to 1506 conditions per place. [2024-06-28 01:46:48,074 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 162 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2024-06-28 01:46:48,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 186 transitions, 2238 flow [2024-06-28 01:46:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:46:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:46:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 01:46:48,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-06-28 01:46:48,076 INFO L175 Difference]: Start difference. First operand has 111 places, 165 transitions, 1781 flow. Second operand 7 states and 118 transitions. [2024-06-28 01:46:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 186 transitions, 2238 flow [2024-06-28 01:46:48,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 186 transitions, 2141 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:48,100 INFO L231 Difference]: Finished difference. Result has 113 places, 165 transitions, 1726 flow [2024-06-28 01:46:48,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1726, PETRI_PLACES=113, PETRI_TRANSITIONS=165} [2024-06-28 01:46:48,100 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-28 01:46:48,100 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 165 transitions, 1726 flow [2024-06-28 01:46:48,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:48,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:48,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:48,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:46:48,101 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:48,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 851394989, now seen corresponding path program 1 times [2024-06-28 01:46:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:48,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123251203] [2024-06-28 01:46:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:48,694 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 01:46:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123251203] [2024-06-28 01:46:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123251203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733358898] [2024-06-28 01:46:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:48,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:48,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:48,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 165 transitions, 1726 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:48,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:48,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:48,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:49,325 INFO L124 PetriNetUnfolderBase]: 1063/2106 cut-off events. [2024-06-28 01:46:49,325 INFO L125 PetriNetUnfolderBase]: For 11036/11036 co-relation queries the response was YES. [2024-06-28 01:46:49,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9115 conditions, 2106 events. 1063/2106 cut-off events. For 11036/11036 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13382 event pairs, 279 based on Foata normal form. 2/2015 useless extension candidates. Maximal degree in co-relation 9063. Up to 1517 conditions per place. [2024-06-28 01:46:49,338 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 191 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-06-28 01:46:49,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 236 transitions, 2622 flow [2024-06-28 01:46:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:46:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:46:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-06-28 01:46:49,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47911547911547914 [2024-06-28 01:46:49,353 INFO L175 Difference]: Start difference. First operand has 113 places, 165 transitions, 1726 flow. Second operand 11 states and 195 transitions. [2024-06-28 01:46:49,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 236 transitions, 2622 flow [2024-06-28 01:46:49,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 236 transitions, 2569 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:46:49,369 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 1991 flow [2024-06-28 01:46:49,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1991, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2024-06-28 01:46:49,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2024-06-28 01:46:49,370 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 1991 flow [2024-06-28 01:46:49,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:49,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:49,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:49,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:46:49,371 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:49,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1387764507, now seen corresponding path program 2 times [2024-06-28 01:46:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454297357] [2024-06-28 01:46:49,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:50,019 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 01:46:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454297357] [2024-06-28 01:46:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454297357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444702341] [2024-06-28 01:46:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:50,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:50,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 1991 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:50,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:50,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:50,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:50,602 INFO L124 PetriNetUnfolderBase]: 1151/2288 cut-off events. [2024-06-28 01:46:50,603 INFO L125 PetriNetUnfolderBase]: For 13436/13436 co-relation queries the response was YES. [2024-06-28 01:46:50,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 2288 events. 1151/2288 cut-off events. For 13436/13436 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14915 event pairs, 299 based on Foata normal form. 2/2187 useless extension candidates. Maximal degree in co-relation 10270. Up to 1639 conditions per place. [2024-06-28 01:46:50,617 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 188 selfloop transitions, 43 changer transitions 0/238 dead transitions. [2024-06-28 01:46:50,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 238 transitions, 2769 flow [2024-06-28 01:46:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 01:46:50,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2024-06-28 01:46:50,618 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 1991 flow. Second operand 9 states and 163 transitions. [2024-06-28 01:46:50,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 238 transitions, 2769 flow [2024-06-28 01:46:50,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 238 transitions, 2702 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-06-28 01:46:50,640 INFO L231 Difference]: Finished difference. Result has 130 places, 201 transitions, 2177 flow [2024-06-28 01:46:50,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2177, PETRI_PLACES=130, PETRI_TRANSITIONS=201} [2024-06-28 01:46:50,641 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-06-28 01:46:50,641 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 201 transitions, 2177 flow [2024-06-28 01:46:50,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:50,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:50,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:50,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:46:50,641 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:50,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1386693147, now seen corresponding path program 3 times [2024-06-28 01:46:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93598198] [2024-06-28 01:46:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:51,234 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 01:46:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:51,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93598198] [2024-06-28 01:46:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93598198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:51,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713875476] [2024-06-28 01:46:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:51,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:51,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:51,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:51,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 201 transitions, 2177 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:51,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:51,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:51,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:51,780 INFO L124 PetriNetUnfolderBase]: 1193/2347 cut-off events. [2024-06-28 01:46:51,780 INFO L125 PetriNetUnfolderBase]: For 14792/14792 co-relation queries the response was YES. [2024-06-28 01:46:51,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 2347 events. 1193/2347 cut-off events. For 14792/14792 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15255 event pairs, 246 based on Foata normal form. 2/2247 useless extension candidates. Maximal degree in co-relation 10728. Up to 1396 conditions per place. [2024-06-28 01:46:51,795 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 160 selfloop transitions, 81 changer transitions 0/248 dead transitions. [2024-06-28 01:46:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 248 transitions, 2970 flow [2024-06-28 01:46:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:46:51,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:46:51,796 INFO L175 Difference]: Start difference. First operand has 130 places, 201 transitions, 2177 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:46:51,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 248 transitions, 2970 flow [2024-06-28 01:46:51,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 248 transitions, 2916 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:51,820 INFO L231 Difference]: Finished difference. Result has 136 places, 209 transitions, 2403 flow [2024-06-28 01:46:51,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2403, PETRI_PLACES=136, PETRI_TRANSITIONS=209} [2024-06-28 01:46:51,820 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2024-06-28 01:46:51,820 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 209 transitions, 2403 flow [2024-06-28 01:46:51,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:51,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:51,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:51,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:46:51,821 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:51,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1419933951, now seen corresponding path program 1 times [2024-06-28 01:46:51,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:51,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651881497] [2024-06-28 01:46:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:51,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:52,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 01:46:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651881497] [2024-06-28 01:46:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651881497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:52,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:52,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:52,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762867543] [2024-06-28 01:46:52,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:52,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:52,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:52,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:52,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 209 transitions, 2403 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:52,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:52,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:53,085 INFO L124 PetriNetUnfolderBase]: 1214/2423 cut-off events. [2024-06-28 01:46:53,086 INFO L125 PetriNetUnfolderBase]: For 17106/17106 co-relation queries the response was YES. [2024-06-28 01:46:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11436 conditions, 2423 events. 1214/2423 cut-off events. For 17106/17106 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16211 event pairs, 309 based on Foata normal form. 1/2312 useless extension candidates. Maximal degree in co-relation 11374. Up to 1619 conditions per place. [2024-06-28 01:46:53,102 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 181 selfloop transitions, 67 changer transitions 0/255 dead transitions. [2024-06-28 01:46:53,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 255 transitions, 3211 flow [2024-06-28 01:46:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:46:53,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:46:53,106 INFO L175 Difference]: Start difference. First operand has 136 places, 209 transitions, 2403 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:46:53,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 255 transitions, 3211 flow [2024-06-28 01:46:53,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 255 transitions, 3133 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-28 01:46:53,139 INFO L231 Difference]: Finished difference. Result has 143 places, 222 transitions, 2634 flow [2024-06-28 01:46:53,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2634, PETRI_PLACES=143, PETRI_TRANSITIONS=222} [2024-06-28 01:46:53,139 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-28 01:46:53,139 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 222 transitions, 2634 flow [2024-06-28 01:46:53,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:53,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:53,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:46:53,140 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:53,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1860504165, now seen corresponding path program 4 times [2024-06-28 01:46:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:53,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664294058] [2024-06-28 01:46:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:46:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664294058] [2024-06-28 01:46:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664294058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827122726] [2024-06-28 01:46:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:53,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:53,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 222 transitions, 2634 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:53,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:53,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:53,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:54,527 INFO L124 PetriNetUnfolderBase]: 1342/2611 cut-off events. [2024-06-28 01:46:54,527 INFO L125 PetriNetUnfolderBase]: For 20851/20851 co-relation queries the response was YES. [2024-06-28 01:46:54,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13076 conditions, 2611 events. 1342/2611 cut-off events. For 20851/20851 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17808 event pairs, 370 based on Foata normal form. 2/2509 useless extension candidates. Maximal degree in co-relation 13010. Up to 1970 conditions per place. [2024-06-28 01:46:54,546 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 223 selfloop transitions, 48 changer transitions 0/278 dead transitions. [2024-06-28 01:46:54,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 278 transitions, 3586 flow [2024-06-28 01:46:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 01:46:54,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-06-28 01:46:54,548 INFO L175 Difference]: Start difference. First operand has 143 places, 222 transitions, 2634 flow. Second operand 9 states and 157 transitions. [2024-06-28 01:46:54,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 278 transitions, 3586 flow [2024-06-28 01:46:54,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 278 transitions, 3555 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:46:54,580 INFO L231 Difference]: Finished difference. Result has 151 places, 245 transitions, 3008 flow [2024-06-28 01:46:54,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3008, PETRI_PLACES=151, PETRI_TRANSITIONS=245} [2024-06-28 01:46:54,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2024-06-28 01:46:54,580 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 245 transitions, 3008 flow [2024-06-28 01:46:54,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:54,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:54,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:54,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:46:54,581 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:54,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1860624135, now seen corresponding path program 5 times [2024-06-28 01:46:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410129501] [2024-06-28 01:46:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:55,258 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 01:46:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410129501] [2024-06-28 01:46:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410129501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171361417] [2024-06-28 01:46:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:55,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:55,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:55,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 245 transitions, 3008 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:55,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:55,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:55,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:55,924 INFO L124 PetriNetUnfolderBase]: 1444/2808 cut-off events. [2024-06-28 01:46:55,924 INFO L125 PetriNetUnfolderBase]: For 24517/24517 co-relation queries the response was YES. [2024-06-28 01:46:55,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14480 conditions, 2808 events. 1444/2808 cut-off events. For 24517/24517 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19441 event pairs, 388 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 14410. Up to 1913 conditions per place. [2024-06-28 01:46:55,948 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 198 selfloop transitions, 93 changer transitions 0/298 dead transitions. [2024-06-28 01:46:55,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 298 transitions, 4028 flow [2024-06-28 01:46:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 01:46:55,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-06-28 01:46:55,950 INFO L175 Difference]: Start difference. First operand has 151 places, 245 transitions, 3008 flow. Second operand 9 states and 164 transitions. [2024-06-28 01:46:55,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 298 transitions, 4028 flow [2024-06-28 01:46:55,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 298 transitions, 3975 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:46:55,995 INFO L231 Difference]: Finished difference. Result has 157 places, 259 transitions, 3309 flow [2024-06-28 01:46:55,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3309, PETRI_PLACES=157, PETRI_TRANSITIONS=259} [2024-06-28 01:46:55,996 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-06-28 01:46:55,996 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 259 transitions, 3309 flow [2024-06-28 01:46:55,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:55,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:55,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:55,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:46:55,997 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:55,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1340251387, now seen corresponding path program 2 times [2024-06-28 01:46:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030978120] [2024-06-28 01:46:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:56,822 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 01:46:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030978120] [2024-06-28 01:46:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030978120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458792604] [2024-06-28 01:46:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:56,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:56,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:56,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 259 transitions, 3309 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:56,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:56,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:56,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:57,437 INFO L124 PetriNetUnfolderBase]: 1521/3008 cut-off events. [2024-06-28 01:46:57,438 INFO L125 PetriNetUnfolderBase]: For 27960/27960 co-relation queries the response was YES. [2024-06-28 01:46:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15548 conditions, 3008 events. 1521/3008 cut-off events. For 27960/27960 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21461 event pairs, 413 based on Foata normal form. 1/2876 useless extension candidates. Maximal degree in co-relation 15477. Up to 2025 conditions per place. [2024-06-28 01:46:57,459 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 220 selfloop transitions, 85 changer transitions 0/312 dead transitions. [2024-06-28 01:46:57,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 312 transitions, 4324 flow [2024-06-28 01:46:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-28 01:46:57,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-06-28 01:46:57,461 INFO L175 Difference]: Start difference. First operand has 157 places, 259 transitions, 3309 flow. Second operand 9 states and 167 transitions. [2024-06-28 01:46:57,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 312 transitions, 4324 flow [2024-06-28 01:46:57,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 312 transitions, 4209 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:57,504 INFO L231 Difference]: Finished difference. Result has 162 places, 274 transitions, 3546 flow [2024-06-28 01:46:57,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3194, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3546, PETRI_PLACES=162, PETRI_TRANSITIONS=274} [2024-06-28 01:46:57,509 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2024-06-28 01:46:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 274 transitions, 3546 flow [2024-06-28 01:46:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:57,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:57,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:57,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:46:57,510 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:57,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash -305139067, now seen corresponding path program 3 times [2024-06-28 01:46:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399758874] [2024-06-28 01:46:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:58,158 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 01:46:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399758874] [2024-06-28 01:46:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399758874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:58,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172179002] [2024-06-28 01:46:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:58,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:58,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:58,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:58,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:58,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 274 transitions, 3546 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:58,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:58,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:46:58,885 INFO L124 PetriNetUnfolderBase]: 1566/3099 cut-off events. [2024-06-28 01:46:58,886 INFO L125 PetriNetUnfolderBase]: For 30718/30718 co-relation queries the response was YES. [2024-06-28 01:46:58,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16518 conditions, 3099 events. 1566/3099 cut-off events. For 30718/30718 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22236 event pairs, 439 based on Foata normal form. 1/2962 useless extension candidates. Maximal degree in co-relation 16444. Up to 2224 conditions per place. [2024-06-28 01:46:58,910 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 247 selfloop transitions, 72 changer transitions 0/326 dead transitions. [2024-06-28 01:46:58,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 326 transitions, 4624 flow [2024-06-28 01:46:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:46:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:46:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:46:58,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:46:58,912 INFO L175 Difference]: Start difference. First operand has 162 places, 274 transitions, 3546 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:46:58,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 326 transitions, 4624 flow [2024-06-28 01:46:58,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 326 transitions, 4545 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:46:58,960 INFO L231 Difference]: Finished difference. Result has 167 places, 285 transitions, 3764 flow [2024-06-28 01:46:58,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3469, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3764, PETRI_PLACES=167, PETRI_TRANSITIONS=285} [2024-06-28 01:46:58,961 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-28 01:46:58,961 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 285 transitions, 3764 flow [2024-06-28 01:46:58,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:58,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:46:58,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:46:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:46:58,962 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:46:58,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:46:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -338207263, now seen corresponding path program 6 times [2024-06-28 01:46:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:46:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820756354] [2024-06-28 01:46:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:46:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:46:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:46:59,643 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 01:46:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:46:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820756354] [2024-06-28 01:46:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820756354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:46:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:46:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:46:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535856967] [2024-06-28 01:46:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:46:59,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:46:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:46:59,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:46:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:46:59,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:46:59,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 285 transitions, 3764 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:46:59,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:46:59,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:46:59,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:00,322 INFO L124 PetriNetUnfolderBase]: 1574/3093 cut-off events. [2024-06-28 01:47:00,322 INFO L125 PetriNetUnfolderBase]: For 31615/31615 co-relation queries the response was YES. [2024-06-28 01:47:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16935 conditions, 3093 events. 1574/3093 cut-off events. For 31615/31615 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22145 event pairs, 444 based on Foata normal form. 1/2962 useless extension candidates. Maximal degree in co-relation 16858. Up to 2408 conditions per place. [2024-06-28 01:47:00,346 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 258 selfloop transitions, 53 changer transitions 0/318 dead transitions. [2024-06-28 01:47:00,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 318 transitions, 4603 flow [2024-06-28 01:47:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 01:47:00,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2024-06-28 01:47:00,347 INFO L175 Difference]: Start difference. First operand has 167 places, 285 transitions, 3764 flow. Second operand 9 states and 156 transitions. [2024-06-28 01:47:00,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 318 transitions, 4603 flow [2024-06-28 01:47:00,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 318 transitions, 4531 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:00,404 INFO L231 Difference]: Finished difference. Result has 171 places, 289 transitions, 3860 flow [2024-06-28 01:47:00,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3860, PETRI_PLACES=171, PETRI_TRANSITIONS=289} [2024-06-28 01:47:00,405 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-06-28 01:47:00,406 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 289 transitions, 3860 flow [2024-06-28 01:47:00,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:00,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:00,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:47:00,406 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:00,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -338200567, now seen corresponding path program 4 times [2024-06-28 01:47:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540664250] [2024-06-28 01:47:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:01,049 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 01:47:01,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:01,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540664250] [2024-06-28 01:47:01,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540664250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:01,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:01,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31463148] [2024-06-28 01:47:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:01,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:01,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:01,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 289 transitions, 3860 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:01,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:01,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:01,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:01,849 INFO L124 PetriNetUnfolderBase]: 1568/3096 cut-off events. [2024-06-28 01:47:01,849 INFO L125 PetriNetUnfolderBase]: For 32487/32487 co-relation queries the response was YES. [2024-06-28 01:47:01,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17145 conditions, 3096 events. 1568/3096 cut-off events. For 32487/32487 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22263 event pairs, 436 based on Foata normal form. 3/2963 useless extension candidates. Maximal degree in co-relation 17066. Up to 2272 conditions per place. [2024-06-28 01:47:01,870 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 256 selfloop transitions, 64 changer transitions 0/327 dead transitions. [2024-06-28 01:47:01,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 327 transitions, 4750 flow [2024-06-28 01:47:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:47:01,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:47:01,873 INFO L175 Difference]: Start difference. First operand has 171 places, 289 transitions, 3860 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:47:01,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 327 transitions, 4750 flow [2024-06-28 01:47:01,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 327 transitions, 4623 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:01,934 INFO L231 Difference]: Finished difference. Result has 173 places, 289 transitions, 3872 flow [2024-06-28 01:47:01,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3733, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3872, PETRI_PLACES=173, PETRI_TRANSITIONS=289} [2024-06-28 01:47:01,935 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2024-06-28 01:47:01,935 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 289 transitions, 3872 flow [2024-06-28 01:47:01,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:01,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:01,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:47:01,935 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:01,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1491938847, now seen corresponding path program 7 times [2024-06-28 01:47:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385338657] [2024-06-28 01:47:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:02,768 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 01:47:02,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:02,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385338657] [2024-06-28 01:47:02,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385338657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:02,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:02,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:02,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199294626] [2024-06-28 01:47:02,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:02,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:02,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:02,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:02,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 289 transitions, 3872 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:02,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:02,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:02,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:03,544 INFO L124 PetriNetUnfolderBase]: 1570/3088 cut-off events. [2024-06-28 01:47:03,544 INFO L125 PetriNetUnfolderBase]: For 32168/32168 co-relation queries the response was YES. [2024-06-28 01:47:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17224 conditions, 3088 events. 1570/3088 cut-off events. For 32168/32168 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21610 event pairs, 347 based on Foata normal form. 2/2957 useless extension candidates. Maximal degree in co-relation 17144. Up to 2078 conditions per place. [2024-06-28 01:47:03,573 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 233 selfloop transitions, 82 changer transitions 0/322 dead transitions. [2024-06-28 01:47:03,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 322 transitions, 4718 flow [2024-06-28 01:47:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:47:03,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-06-28 01:47:03,574 INFO L175 Difference]: Start difference. First operand has 173 places, 289 transitions, 3872 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:47:03,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 322 transitions, 4718 flow [2024-06-28 01:47:03,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 322 transitions, 4568 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-28 01:47:03,643 INFO L231 Difference]: Finished difference. Result has 173 places, 291 transitions, 3964 flow [2024-06-28 01:47:03,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3964, PETRI_PLACES=173, PETRI_TRANSITIONS=291} [2024-06-28 01:47:03,644 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2024-06-28 01:47:03,644 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 291 transitions, 3964 flow [2024-06-28 01:47:03,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:03,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:03,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:47:03,645 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:03,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1254912497, now seen corresponding path program 8 times [2024-06-28 01:47:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481375711] [2024-06-28 01:47:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:04,327 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 01:47:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481375711] [2024-06-28 01:47:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481375711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734277672] [2024-06-28 01:47:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:04,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:04,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 291 transitions, 3964 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:04,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:04,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:04,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:05,012 INFO L124 PetriNetUnfolderBase]: 1618/3074 cut-off events. [2024-06-28 01:47:05,013 INFO L125 PetriNetUnfolderBase]: For 35220/35220 co-relation queries the response was YES. [2024-06-28 01:47:05,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17954 conditions, 3074 events. 1618/3074 cut-off events. For 35220/35220 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21258 event pairs, 237 based on Foata normal form. 2/2963 useless extension candidates. Maximal degree in co-relation 17873. Up to 1744 conditions per place. [2024-06-28 01:47:05,041 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 170 selfloop transitions, 156 changer transitions 0/333 dead transitions. [2024-06-28 01:47:05,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 333 transitions, 5009 flow [2024-06-28 01:47:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:47:05,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-06-28 01:47:05,042 INFO L175 Difference]: Start difference. First operand has 173 places, 291 transitions, 3964 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:47:05,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 333 transitions, 5009 flow [2024-06-28 01:47:05,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 333 transitions, 4857 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:05,116 INFO L231 Difference]: Finished difference. Result has 174 places, 299 transitions, 4272 flow [2024-06-28 01:47:05,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4272, PETRI_PLACES=174, PETRI_TRANSITIONS=299} [2024-06-28 01:47:05,117 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-06-28 01:47:05,117 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 299 transitions, 4272 flow [2024-06-28 01:47:05,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:05,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:05,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:05,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:47:05,118 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:05,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash -706175517, now seen corresponding path program 5 times [2024-06-28 01:47:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80472122] [2024-06-28 01:47:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:05,788 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 01:47:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80472122] [2024-06-28 01:47:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80472122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749503453] [2024-06-28 01:47:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:05,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:05,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:05,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 299 transitions, 4272 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:05,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:05,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:05,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:06,481 INFO L124 PetriNetUnfolderBase]: 1668/3331 cut-off events. [2024-06-28 01:47:06,481 INFO L125 PetriNetUnfolderBase]: For 37078/37078 co-relation queries the response was YES. [2024-06-28 01:47:06,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19032 conditions, 3331 events. 1668/3331 cut-off events. For 37078/37078 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 24157 event pairs, 342 based on Foata normal form. 1/3168 useless extension candidates. Maximal degree in co-relation 18951. Up to 1934 conditions per place. [2024-06-28 01:47:06,504 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 204 selfloop transitions, 132 changer transitions 0/343 dead transitions. [2024-06-28 01:47:06,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 343 transitions, 5319 flow [2024-06-28 01:47:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-28 01:47:06,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101351351351351 [2024-06-28 01:47:06,513 INFO L175 Difference]: Start difference. First operand has 174 places, 299 transitions, 4272 flow. Second operand 8 states and 151 transitions. [2024-06-28 01:47:06,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 343 transitions, 5319 flow [2024-06-28 01:47:06,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 343 transitions, 5134 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:06,581 INFO L231 Difference]: Finished difference. Result has 178 places, 308 transitions, 4558 flow [2024-06-28 01:47:06,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4091, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4558, PETRI_PLACES=178, PETRI_TRANSITIONS=308} [2024-06-28 01:47:06,582 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places. [2024-06-28 01:47:06,582 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 308 transitions, 4558 flow [2024-06-28 01:47:06,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:06,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:06,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:06,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:47:06,583 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:06,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash -701527377, now seen corresponding path program 6 times [2024-06-28 01:47:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715341720] [2024-06-28 01:47:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:07,348 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 01:47:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:07,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715341720] [2024-06-28 01:47:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715341720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:07,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583419902] [2024-06-28 01:47:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:07,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:07,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 308 transitions, 4558 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:07,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:07,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:07,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:08,040 INFO L124 PetriNetUnfolderBase]: 1735/3409 cut-off events. [2024-06-28 01:47:08,040 INFO L125 PetriNetUnfolderBase]: For 39254/39254 co-relation queries the response was YES. [2024-06-28 01:47:08,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20244 conditions, 3409 events. 1735/3409 cut-off events. For 39254/39254 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24910 event pairs, 459 based on Foata normal form. 3/3264 useless extension candidates. Maximal degree in co-relation 20161. Up to 2382 conditions per place. [2024-06-28 01:47:08,067 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 270 selfloop transitions, 83 changer transitions 0/360 dead transitions. [2024-06-28 01:47:08,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 360 transitions, 5736 flow [2024-06-28 01:47:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:47:08,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-06-28 01:47:08,070 INFO L175 Difference]: Start difference. First operand has 178 places, 308 transitions, 4558 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:47:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 360 transitions, 5736 flow [2024-06-28 01:47:08,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 360 transitions, 5637 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:08,143 INFO L231 Difference]: Finished difference. Result has 181 places, 320 transitions, 4835 flow [2024-06-28 01:47:08,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4835, PETRI_PLACES=181, PETRI_TRANSITIONS=320} [2024-06-28 01:47:08,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-28 01:47:08,144 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 320 transitions, 4835 flow [2024-06-28 01:47:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:08,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:08,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:08,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:47:08,144 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:08,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1487177061, now seen corresponding path program 7 times [2024-06-28 01:47:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:08,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820029862] [2024-06-28 01:47:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:08,974 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 01:47:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820029862] [2024-06-28 01:47:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820029862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:08,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512190949] [2024-06-28 01:47:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:08,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:09,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:09,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 320 transitions, 4835 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:09,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:09,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:09,647 INFO L124 PetriNetUnfolderBase]: 1766/3503 cut-off events. [2024-06-28 01:47:09,648 INFO L125 PetriNetUnfolderBase]: For 39568/39568 co-relation queries the response was YES. [2024-06-28 01:47:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21112 conditions, 3503 events. 1766/3503 cut-off events. For 39568/39568 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25890 event pairs, 439 based on Foata normal form. 1/3344 useless extension candidates. Maximal degree in co-relation 21028. Up to 2337 conditions per place. [2024-06-28 01:47:09,678 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 258 selfloop transitions, 107 changer transitions 0/372 dead transitions. [2024-06-28 01:47:09,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 372 transitions, 6065 flow [2024-06-28 01:47:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:47:09,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-06-28 01:47:09,679 INFO L175 Difference]: Start difference. First operand has 181 places, 320 transitions, 4835 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:47:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 372 transitions, 6065 flow [2024-06-28 01:47:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 372 transitions, 5891 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:09,811 INFO L231 Difference]: Finished difference. Result has 182 places, 330 transitions, 5083 flow [2024-06-28 01:47:09,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4665, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5083, PETRI_PLACES=182, PETRI_TRANSITIONS=330} [2024-06-28 01:47:09,811 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-28 01:47:09,811 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 330 transitions, 5083 flow [2024-06-28 01:47:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:09,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:09,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:09,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:47:09,812 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:09,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1487177247, now seen corresponding path program 9 times [2024-06-28 01:47:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413839857] [2024-06-28 01:47:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:47:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413839857] [2024-06-28 01:47:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413839857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:10,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674775092] [2024-06-28 01:47:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:10,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:10,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:10,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 330 transitions, 5083 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:10,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:10,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:11,148 INFO L124 PetriNetUnfolderBase]: 1826/3572 cut-off events. [2024-06-28 01:47:11,148 INFO L125 PetriNetUnfolderBase]: For 41190/41190 co-relation queries the response was YES. [2024-06-28 01:47:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21804 conditions, 3572 events. 1826/3572 cut-off events. For 41190/41190 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 26190 event pairs, 499 based on Foata normal form. 3/3424 useless extension candidates. Maximal degree in co-relation 21720. Up to 2696 conditions per place. [2024-06-28 01:47:11,176 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 286 selfloop transitions, 76 changer transitions 0/369 dead transitions. [2024-06-28 01:47:11,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 369 transitions, 6165 flow [2024-06-28 01:47:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 01:47:11,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:47:11,178 INFO L175 Difference]: Start difference. First operand has 182 places, 330 transitions, 5083 flow. Second operand 8 states and 140 transitions. [2024-06-28 01:47:11,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 369 transitions, 6165 flow [2024-06-28 01:47:11,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 369 transitions, 5908 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:11,259 INFO L231 Difference]: Finished difference. Result has 183 places, 340 transitions, 5179 flow [2024-06-28 01:47:11,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4838, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5179, PETRI_PLACES=183, PETRI_TRANSITIONS=340} [2024-06-28 01:47:11,260 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places. [2024-06-28 01:47:11,260 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 340 transitions, 5179 flow [2024-06-28 01:47:11,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:11,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:11,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:11,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:47:11,260 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:11,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 431574947, now seen corresponding path program 8 times [2024-06-28 01:47:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968131062] [2024-06-28 01:47:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:11,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 01:47:11,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:11,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968131062] [2024-06-28 01:47:11,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968131062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:11,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:11,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198250013] [2024-06-28 01:47:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:11,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:11,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:11,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 340 transitions, 5179 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:11,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:11,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:11,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:12,623 INFO L124 PetriNetUnfolderBase]: 1893/3677 cut-off events. [2024-06-28 01:47:12,624 INFO L125 PetriNetUnfolderBase]: For 41356/41356 co-relation queries the response was YES. [2024-06-28 01:47:12,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22421 conditions, 3677 events. 1893/3677 cut-off events. For 41356/41356 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 27044 event pairs, 591 based on Foata normal form. 3/3529 useless extension candidates. Maximal degree in co-relation 22337. Up to 2887 conditions per place. [2024-06-28 01:47:12,661 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 345 selfloop transitions, 30 changer transitions 0/382 dead transitions. [2024-06-28 01:47:12,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 382 transitions, 6352 flow [2024-06-28 01:47:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:47:12,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:47:12,664 INFO L175 Difference]: Start difference. First operand has 183 places, 340 transitions, 5179 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:47:12,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 382 transitions, 6352 flow [2024-06-28 01:47:12,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 382 transitions, 6149 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:12,757 INFO L231 Difference]: Finished difference. Result has 185 places, 352 transitions, 5279 flow [2024-06-28 01:47:12,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4976, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5279, PETRI_PLACES=185, PETRI_TRANSITIONS=352} [2024-06-28 01:47:12,758 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-28 01:47:12,758 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 352 transitions, 5279 flow [2024-06-28 01:47:12,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:12,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:12,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:12,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:47:12,758 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:12,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2057999871, now seen corresponding path program 9 times [2024-06-28 01:47:12,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:12,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127696274] [2024-06-28 01:47:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:13,522 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 01:47:13,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127696274] [2024-06-28 01:47:13,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127696274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839509979] [2024-06-28 01:47:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:13,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:13,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:13,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 352 transitions, 5279 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:13,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:13,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:13,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:14,244 INFO L124 PetriNetUnfolderBase]: 1920/3765 cut-off events. [2024-06-28 01:47:14,245 INFO L125 PetriNetUnfolderBase]: For 41488/41488 co-relation queries the response was YES. [2024-06-28 01:47:14,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22669 conditions, 3765 events. 1920/3765 cut-off events. For 41488/41488 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27939 event pairs, 576 based on Foata normal form. 3/3605 useless extension candidates. Maximal degree in co-relation 22584. Up to 2864 conditions per place. [2024-06-28 01:47:14,281 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 354 selfloop transitions, 43 changer transitions 0/404 dead transitions. [2024-06-28 01:47:14,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 404 transitions, 6621 flow [2024-06-28 01:47:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 01:47:14,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-06-28 01:47:14,283 INFO L175 Difference]: Start difference. First operand has 185 places, 352 transitions, 5279 flow. Second operand 8 states and 141 transitions. [2024-06-28 01:47:14,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 404 transitions, 6621 flow [2024-06-28 01:47:14,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 404 transitions, 6509 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:14,416 INFO L231 Difference]: Finished difference. Result has 187 places, 362 transitions, 5489 flow [2024-06-28 01:47:14,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5167, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5489, PETRI_PLACES=187, PETRI_TRANSITIONS=362} [2024-06-28 01:47:14,420 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places. [2024-06-28 01:47:14,420 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 362 transitions, 5489 flow [2024-06-28 01:47:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:14,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:14,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:47:14,421 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:14,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2058006567, now seen corresponding path program 10 times [2024-06-28 01:47:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804682047] [2024-06-28 01:47:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:15,058 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 01:47:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804682047] [2024-06-28 01:47:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804682047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085066174] [2024-06-28 01:47:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:15,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:15,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 362 transitions, 5489 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:15,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:15,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:15,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:15,761 INFO L124 PetriNetUnfolderBase]: 1918/3750 cut-off events. [2024-06-28 01:47:15,761 INFO L125 PetriNetUnfolderBase]: For 41051/41051 co-relation queries the response was YES. [2024-06-28 01:47:15,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22648 conditions, 3750 events. 1918/3750 cut-off events. For 41051/41051 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27765 event pairs, 591 based on Foata normal form. 1/3591 useless extension candidates. Maximal degree in co-relation 22562. Up to 2985 conditions per place. [2024-06-28 01:47:15,798 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 352 selfloop transitions, 33 changer transitions 0/392 dead transitions. [2024-06-28 01:47:15,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 392 transitions, 6523 flow [2024-06-28 01:47:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:47:15,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-28 01:47:15,799 INFO L175 Difference]: Start difference. First operand has 187 places, 362 transitions, 5489 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:47:15,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 392 transitions, 6523 flow [2024-06-28 01:47:15,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 392 transitions, 6361 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:15,911 INFO L231 Difference]: Finished difference. Result has 189 places, 368 transitions, 5510 flow [2024-06-28 01:47:15,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5327, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5510, PETRI_PLACES=189, PETRI_TRANSITIONS=368} [2024-06-28 01:47:15,912 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2024-06-28 01:47:15,912 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 368 transitions, 5510 flow [2024-06-28 01:47:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:15,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:15,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:47:15,913 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:15,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2058006381, now seen corresponding path program 10 times [2024-06-28 01:47:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845940730] [2024-06-28 01:47:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:16,575 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 01:47:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845940730] [2024-06-28 01:47:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845940730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660395344] [2024-06-28 01:47:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:16,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:16,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:16,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 368 transitions, 5510 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:16,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:16,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:16,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:17,288 INFO L124 PetriNetUnfolderBase]: 1916/3763 cut-off events. [2024-06-28 01:47:17,288 INFO L125 PetriNetUnfolderBase]: For 40977/40977 co-relation queries the response was YES. [2024-06-28 01:47:17,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22536 conditions, 3763 events. 1916/3763 cut-off events. For 40977/40977 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27970 event pairs, 556 based on Foata normal form. 1/3600 useless extension candidates. Maximal degree in co-relation 22449. Up to 2735 conditions per place. [2024-06-28 01:47:17,326 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 326 selfloop transitions, 71 changer transitions 0/404 dead transitions. [2024-06-28 01:47:17,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 404 transitions, 6602 flow [2024-06-28 01:47:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 01:47:17,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:47:17,327 INFO L175 Difference]: Start difference. First operand has 189 places, 368 transitions, 5510 flow. Second operand 8 states and 140 transitions. [2024-06-28 01:47:17,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 404 transitions, 6602 flow [2024-06-28 01:47:17,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 404 transitions, 6506 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:17,452 INFO L231 Difference]: Finished difference. Result has 192 places, 368 transitions, 5573 flow [2024-06-28 01:47:17,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5414, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5573, PETRI_PLACES=192, PETRI_TRANSITIONS=368} [2024-06-28 01:47:17,453 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2024-06-28 01:47:17,453 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 368 transitions, 5573 flow [2024-06-28 01:47:17,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:17,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:17,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:17,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:47:17,454 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:17,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2048506183, now seen corresponding path program 1 times [2024-06-28 01:47:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101976431] [2024-06-28 01:47:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:18,065 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 01:47:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101976431] [2024-06-28 01:47:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101976431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:47:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102823509] [2024-06-28 01:47:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:18,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:47:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:47:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:47:18,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:18,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 368 transitions, 5573 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:18,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:18,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:18,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:18,820 INFO L124 PetriNetUnfolderBase]: 1928/3754 cut-off events. [2024-06-28 01:47:18,821 INFO L125 PetriNetUnfolderBase]: For 42387/42387 co-relation queries the response was YES. [2024-06-28 01:47:18,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22761 conditions, 3754 events. 1928/3754 cut-off events. For 42387/42387 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 27724 event pairs, 611 based on Foata normal form. 2/3600 useless extension candidates. Maximal degree in co-relation 22673. Up to 3033 conditions per place. [2024-06-28 01:47:18,858 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 369 selfloop transitions, 17 changer transitions 0/393 dead transitions. [2024-06-28 01:47:18,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 393 transitions, 6513 flow [2024-06-28 01:47:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 01:47:18,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2024-06-28 01:47:18,860 INFO L175 Difference]: Start difference. First operand has 192 places, 368 transitions, 5573 flow. Second operand 8 states and 132 transitions. [2024-06-28 01:47:18,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 393 transitions, 6513 flow [2024-06-28 01:47:18,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 393 transitions, 6157 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:18,976 INFO L231 Difference]: Finished difference. Result has 194 places, 373 transitions, 5312 flow [2024-06-28 01:47:18,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5217, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5312, PETRI_PLACES=194, PETRI_TRANSITIONS=373} [2024-06-28 01:47:18,978 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2024-06-28 01:47:18,978 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 373 transitions, 5312 flow [2024-06-28 01:47:18,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:47:18,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:18,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:47:18,979 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:18,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2048494310, now seen corresponding path program 1 times [2024-06-28 01:47:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934272185] [2024-06-28 01:47:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:19,870 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 01:47:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934272185] [2024-06-28 01:47:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934272185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591611022] [2024-06-28 01:47:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:19,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:19,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:19,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 373 transitions, 5312 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:19,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:19,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:20,754 INFO L124 PetriNetUnfolderBase]: 1925/3762 cut-off events. [2024-06-28 01:47:20,755 INFO L125 PetriNetUnfolderBase]: For 39760/39760 co-relation queries the response was YES. [2024-06-28 01:47:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22472 conditions, 3762 events. 1925/3762 cut-off events. For 39760/39760 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27858 event pairs, 595 based on Foata normal form. 2/3603 useless extension candidates. Maximal degree in co-relation 22382. Up to 3001 conditions per place. [2024-06-28 01:47:20,783 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 375 selfloop transitions, 19 changer transitions 0/401 dead transitions. [2024-06-28 01:47:20,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 401 transitions, 6278 flow [2024-06-28 01:47:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:47:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:47:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 01:47:20,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2024-06-28 01:47:20,784 INFO L175 Difference]: Start difference. First operand has 194 places, 373 transitions, 5312 flow. Second operand 8 states and 135 transitions. [2024-06-28 01:47:20,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 401 transitions, 6278 flow [2024-06-28 01:47:20,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 401 transitions, 6225 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:20,874 INFO L231 Difference]: Finished difference. Result has 198 places, 375 transitions, 5329 flow [2024-06-28 01:47:20,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5329, PETRI_PLACES=198, PETRI_TRANSITIONS=375} [2024-06-28 01:47:20,874 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-06-28 01:47:20,874 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 375 transitions, 5329 flow [2024-06-28 01:47:20,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:20,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:20,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:20,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:47:20,875 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:20,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 623441925, now seen corresponding path program 1 times [2024-06-28 01:47:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:20,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002794393] [2024-06-28 01:47:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:21,482 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 01:47:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002794393] [2024-06-28 01:47:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002794393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048820451] [2024-06-28 01:47:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:21,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:21,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:21,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:21,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 375 transitions, 5329 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:21,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:21,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:21,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:22,557 INFO L124 PetriNetUnfolderBase]: 1987/3920 cut-off events. [2024-06-28 01:47:22,557 INFO L125 PetriNetUnfolderBase]: For 42027/42027 co-relation queries the response was YES. [2024-06-28 01:47:22,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 3920 events. 1987/3920 cut-off events. For 42027/42027 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 28906 event pairs, 445 based on Foata normal form. 2/3746 useless extension candidates. Maximal degree in co-relation 23121. Up to 2634 conditions per place. [2024-06-28 01:47:22,591 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 359 selfloop transitions, 69 changer transitions 0/435 dead transitions. [2024-06-28 01:47:22,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 435 transitions, 6669 flow [2024-06-28 01:47:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:47:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:47:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-06-28 01:47:22,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2024-06-28 01:47:22,593 INFO L175 Difference]: Start difference. First operand has 198 places, 375 transitions, 5329 flow. Second operand 12 states and 214 transitions. [2024-06-28 01:47:22,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 435 transitions, 6669 flow [2024-06-28 01:47:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 435 transitions, 6625 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:22,714 INFO L231 Difference]: Finished difference. Result has 206 places, 382 transitions, 5535 flow [2024-06-28 01:47:22,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5285, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5535, PETRI_PLACES=206, PETRI_TRANSITIONS=382} [2024-06-28 01:47:22,714 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places. [2024-06-28 01:47:22,715 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 382 transitions, 5535 flow [2024-06-28 01:47:22,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:22,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:22,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:22,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:47:22,719 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:22,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1072003315, now seen corresponding path program 2 times [2024-06-28 01:47:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429652298] [2024-06-28 01:47:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:23,389 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 01:47:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429652298] [2024-06-28 01:47:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429652298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003361765] [2024-06-28 01:47:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:23,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:23,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 382 transitions, 5535 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:23,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:23,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:24,332 INFO L124 PetriNetUnfolderBase]: 2037/4042 cut-off events. [2024-06-28 01:47:24,333 INFO L125 PetriNetUnfolderBase]: For 46911/46911 co-relation queries the response was YES. [2024-06-28 01:47:24,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24307 conditions, 4042 events. 2037/4042 cut-off events. For 46911/46911 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 30214 event pairs, 475 based on Foata normal form. 2/3858 useless extension candidates. Maximal degree in co-relation 24213. Up to 2903 conditions per place. [2024-06-28 01:47:24,371 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 362 selfloop transitions, 60 changer transitions 0/429 dead transitions. [2024-06-28 01:47:24,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 429 transitions, 6722 flow [2024-06-28 01:47:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-28 01:47:24,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:47:24,372 INFO L175 Difference]: Start difference. First operand has 206 places, 382 transitions, 5535 flow. Second operand 10 states and 180 transitions. [2024-06-28 01:47:24,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 429 transitions, 6722 flow [2024-06-28 01:47:24,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 429 transitions, 6588 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:24,494 INFO L231 Difference]: Finished difference. Result has 210 places, 388 transitions, 5633 flow [2024-06-28 01:47:24,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5437, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5633, PETRI_PLACES=210, PETRI_TRANSITIONS=388} [2024-06-28 01:47:24,495 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places. [2024-06-28 01:47:24,495 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 388 transitions, 5633 flow [2024-06-28 01:47:24,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:24,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:24,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:24,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:47:24,496 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:24,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash 405085585, now seen corresponding path program 3 times [2024-06-28 01:47:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272963391] [2024-06-28 01:47:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:25,178 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 01:47:25,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:25,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272963391] [2024-06-28 01:47:25,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272963391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:25,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:25,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:25,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785859342] [2024-06-28 01:47:25,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:25,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:25,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:25,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:25,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:25,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 388 transitions, 5633 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:25,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:25,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:25,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:26,229 INFO L124 PetriNetUnfolderBase]: 2105/4035 cut-off events. [2024-06-28 01:47:26,229 INFO L125 PetriNetUnfolderBase]: For 49342/49342 co-relation queries the response was YES. [2024-06-28 01:47:26,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25016 conditions, 4035 events. 2105/4035 cut-off events. For 49342/49342 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29657 event pairs, 336 based on Foata normal form. 2/3878 useless extension candidates. Maximal degree in co-relation 24920. Up to 1867 conditions per place. [2024-06-28 01:47:26,273 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 303 selfloop transitions, 138 changer transitions 0/448 dead transitions. [2024-06-28 01:47:26,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 448 transitions, 7104 flow [2024-06-28 01:47:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 01:47:26,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-28 01:47:26,274 INFO L175 Difference]: Start difference. First operand has 210 places, 388 transitions, 5633 flow. Second operand 10 states and 192 transitions. [2024-06-28 01:47:26,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 448 transitions, 7104 flow [2024-06-28 01:47:26,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 448 transitions, 6996 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:26,422 INFO L231 Difference]: Finished difference. Result has 214 places, 398 transitions, 6005 flow [2024-06-28 01:47:26,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5525, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6005, PETRI_PLACES=214, PETRI_TRANSITIONS=398} [2024-06-28 01:47:26,423 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-28 01:47:26,423 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 398 transitions, 6005 flow [2024-06-28 01:47:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:26,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:26,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:26,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:47:26,423 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:26,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash -70875768, now seen corresponding path program 1 times [2024-06-28 01:47:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135246137] [2024-06-28 01:47:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:27,352 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 01:47:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135246137] [2024-06-28 01:47:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135246137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938014108] [2024-06-28 01:47:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:27,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:27,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:27,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 398 transitions, 6005 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:27,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:27,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:28,722 INFO L124 PetriNetUnfolderBase]: 2245/4446 cut-off events. [2024-06-28 01:47:28,722 INFO L125 PetriNetUnfolderBase]: For 56868/56868 co-relation queries the response was YES. [2024-06-28 01:47:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27217 conditions, 4446 events. 2245/4446 cut-off events. For 56868/56868 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 34151 event pairs, 366 based on Foata normal form. 2/4236 useless extension candidates. Maximal degree in co-relation 27119. Up to 2620 conditions per place. [2024-06-28 01:47:28,762 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 335 selfloop transitions, 180 changer transitions 0/522 dead transitions. [2024-06-28 01:47:28,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 522 transitions, 8301 flow [2024-06-28 01:47:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:47:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:47:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 259 transitions. [2024-06-28 01:47:28,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:47:28,763 INFO L175 Difference]: Start difference. First operand has 214 places, 398 transitions, 6005 flow. Second operand 14 states and 259 transitions. [2024-06-28 01:47:28,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 522 transitions, 8301 flow [2024-06-28 01:47:28,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 522 transitions, 8158 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-28 01:47:28,895 INFO L231 Difference]: Finished difference. Result has 227 places, 448 transitions, 6972 flow [2024-06-28 01:47:28,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5891, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6972, PETRI_PLACES=227, PETRI_TRANSITIONS=448} [2024-06-28 01:47:28,896 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places. [2024-06-28 01:47:28,896 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 448 transitions, 6972 flow [2024-06-28 01:47:28,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:28,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:28,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:28,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:47:28,897 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:28,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -70875985, now seen corresponding path program 4 times [2024-06-28 01:47:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463508152] [2024-06-28 01:47:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:29,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 01:47:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463508152] [2024-06-28 01:47:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463508152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720055385] [2024-06-28 01:47:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:29,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:29,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:29,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 448 transitions, 6972 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:29,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:29,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:29,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:30,751 INFO L124 PetriNetUnfolderBase]: 2241/4321 cut-off events. [2024-06-28 01:47:30,751 INFO L125 PetriNetUnfolderBase]: For 62082/62082 co-relation queries the response was YES. [2024-06-28 01:47:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28369 conditions, 4321 events. 2241/4321 cut-off events. For 62082/62082 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32345 event pairs, 342 based on Foata normal form. 2/4148 useless extension candidates. Maximal degree in co-relation 28266. Up to 2082 conditions per place. [2024-06-28 01:47:30,797 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 343 selfloop transitions, 148 changer transitions 0/498 dead transitions. [2024-06-28 01:47:30,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 498 transitions, 8413 flow [2024-06-28 01:47:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 01:47:30,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:47:30,799 INFO L175 Difference]: Start difference. First operand has 227 places, 448 transitions, 6972 flow. Second operand 10 states and 190 transitions. [2024-06-28 01:47:30,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 498 transitions, 8413 flow [2024-06-28 01:47:30,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 498 transitions, 8206 flow, removed 55 selfloop flow, removed 6 redundant places. [2024-06-28 01:47:30,970 INFO L231 Difference]: Finished difference. Result has 231 places, 448 transitions, 7077 flow [2024-06-28 01:47:30,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6775, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7077, PETRI_PLACES=231, PETRI_TRANSITIONS=448} [2024-06-28 01:47:30,970 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places. [2024-06-28 01:47:30,970 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 448 transitions, 7077 flow [2024-06-28 01:47:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:30,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:30,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:30,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:47:30,971 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:30,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1398156169, now seen corresponding path program 5 times [2024-06-28 01:47:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419138098] [2024-06-28 01:47:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:47:31,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419138098] [2024-06-28 01:47:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419138098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:31,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639427303] [2024-06-28 01:47:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:31,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:31,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:31,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:31,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:31,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 448 transitions, 7077 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:31,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:31,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:31,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:32,781 INFO L124 PetriNetUnfolderBase]: 2311/4479 cut-off events. [2024-06-28 01:47:32,781 INFO L125 PetriNetUnfolderBase]: For 66235/66235 co-relation queries the response was YES. [2024-06-28 01:47:32,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29516 conditions, 4479 events. 2311/4479 cut-off events. For 66235/66235 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 34002 event pairs, 599 based on Foata normal form. 2/4299 useless extension candidates. Maximal degree in co-relation 29412. Up to 3400 conditions per place. [2024-06-28 01:47:32,830 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 431 selfloop transitions, 58 changer transitions 0/496 dead transitions. [2024-06-28 01:47:32,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 496 transitions, 8466 flow [2024-06-28 01:47:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:47:32,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-06-28 01:47:32,831 INFO L175 Difference]: Start difference. First operand has 231 places, 448 transitions, 7077 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:47:32,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 496 transitions, 8466 flow [2024-06-28 01:47:33,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 496 transitions, 8140 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:47:33,007 INFO L231 Difference]: Finished difference. Result has 232 places, 458 transitions, 7046 flow [2024-06-28 01:47:33,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6773, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7046, PETRI_PLACES=232, PETRI_TRANSITIONS=458} [2024-06-28 01:47:33,008 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places. [2024-06-28 01:47:33,008 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 458 transitions, 7046 flow [2024-06-28 01:47:33,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:33,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:33,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:33,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:47:33,009 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:33,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1401880819, now seen corresponding path program 6 times [2024-06-28 01:47:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905355964] [2024-06-28 01:47:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:33,659 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 01:47:33,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905355964] [2024-06-28 01:47:33,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905355964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:33,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:33,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078655203] [2024-06-28 01:47:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:33,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:33,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:33,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:33,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:33,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 458 transitions, 7046 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:33,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:33,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:34,721 INFO L124 PetriNetUnfolderBase]: 2525/4896 cut-off events. [2024-06-28 01:47:34,721 INFO L125 PetriNetUnfolderBase]: For 74642/74642 co-relation queries the response was YES. [2024-06-28 01:47:34,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31722 conditions, 4896 events. 2525/4896 cut-off events. For 74642/74642 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37662 event pairs, 563 based on Foata normal form. 2/4697 useless extension candidates. Maximal degree in co-relation 31617. Up to 2834 conditions per place. [2024-06-28 01:47:34,775 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 375 selfloop transitions, 153 changer transitions 0/535 dead transitions. [2024-06-28 01:47:34,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 535 transitions, 9051 flow [2024-06-28 01:47:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:47:34,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:47:34,776 INFO L175 Difference]: Start difference. First operand has 232 places, 458 transitions, 7046 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:47:34,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 535 transitions, 9051 flow [2024-06-28 01:47:34,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 535 transitions, 8937 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:34,967 INFO L231 Difference]: Finished difference. Result has 237 places, 482 transitions, 7713 flow [2024-06-28 01:47:34,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6932, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7713, PETRI_PLACES=237, PETRI_TRANSITIONS=482} [2024-06-28 01:47:34,968 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 196 predicate places. [2024-06-28 01:47:34,968 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 482 transitions, 7713 flow [2024-06-28 01:47:34,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:34,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:34,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:34,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:47:34,969 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:34,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1401875239, now seen corresponding path program 7 times [2024-06-28 01:47:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:34,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242381695] [2024-06-28 01:47:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:35,625 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 01:47:35,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242381695] [2024-06-28 01:47:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242381695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:35,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471537764] [2024-06-28 01:47:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:35,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:35,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:35,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:35,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:35,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 482 transitions, 7713 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:35,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:35,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:35,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:36,747 INFO L124 PetriNetUnfolderBase]: 2521/4890 cut-off events. [2024-06-28 01:47:36,747 INFO L125 PetriNetUnfolderBase]: For 78734/78734 co-relation queries the response was YES. [2024-06-28 01:47:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32696 conditions, 4890 events. 2521/4890 cut-off events. For 78734/78734 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37704 event pairs, 547 based on Foata normal form. 2/4691 useless extension candidates. Maximal degree in co-relation 32588. Up to 2831 conditions per place. [2024-06-28 01:47:36,806 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 379 selfloop transitions, 148 changer transitions 0/534 dead transitions. [2024-06-28 01:47:36,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 534 transitions, 9316 flow [2024-06-28 01:47:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:47:36,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:47:36,808 INFO L175 Difference]: Start difference. First operand has 237 places, 482 transitions, 7713 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:47:36,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 534 transitions, 9316 flow [2024-06-28 01:47:37,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 534 transitions, 9157 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-28 01:47:37,086 INFO L231 Difference]: Finished difference. Result has 243 places, 482 transitions, 7864 flow [2024-06-28 01:47:37,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7554, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7864, PETRI_PLACES=243, PETRI_TRANSITIONS=482} [2024-06-28 01:47:37,087 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places. [2024-06-28 01:47:37,087 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 482 transitions, 7864 flow [2024-06-28 01:47:37,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:37,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:37,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:37,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:47:37,088 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:37,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -869381209, now seen corresponding path program 8 times [2024-06-28 01:47:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923324484] [2024-06-28 01:47:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:37,771 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 01:47:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:37,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923324484] [2024-06-28 01:47:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923324484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709792224] [2024-06-28 01:47:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:37,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:37,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 482 transitions, 7864 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:37,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:37,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:37,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:39,002 INFO L124 PetriNetUnfolderBase]: 2621/5103 cut-off events. [2024-06-28 01:47:39,003 INFO L125 PetriNetUnfolderBase]: For 86159/86159 co-relation queries the response was YES. [2024-06-28 01:47:39,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34427 conditions, 5103 events. 2621/5103 cut-off events. For 86159/86159 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 39957 event pairs, 690 based on Foata normal form. 2/4889 useless extension candidates. Maximal degree in co-relation 34317. Up to 3666 conditions per place. [2024-06-28 01:47:39,064 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 446 selfloop transitions, 92 changer transitions 0/545 dead transitions. [2024-06-28 01:47:39,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 545 transitions, 9715 flow [2024-06-28 01:47:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:47:39,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:47:39,065 INFO L175 Difference]: Start difference. First operand has 243 places, 482 transitions, 7864 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:47:39,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 545 transitions, 9715 flow [2024-06-28 01:47:39,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 545 transitions, 9342 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-28 01:47:39,293 INFO L231 Difference]: Finished difference. Result has 245 places, 497 transitions, 8000 flow [2024-06-28 01:47:39,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7517, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8000, PETRI_PLACES=245, PETRI_TRANSITIONS=497} [2024-06-28 01:47:39,293 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-28 01:47:39,294 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 497 transitions, 8000 flow [2024-06-28 01:47:39,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:39,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:39,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:39,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:47:39,294 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:39,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1894282129, now seen corresponding path program 9 times [2024-06-28 01:47:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991642990] [2024-06-28 01:47:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:40,010 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 01:47:40,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:40,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991642990] [2024-06-28 01:47:40,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991642990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:40,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:40,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166890183] [2024-06-28 01:47:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:40,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:40,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 497 transitions, 8000 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:40,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:40,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:40,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:41,312 INFO L124 PetriNetUnfolderBase]: 2655/5186 cut-off events. [2024-06-28 01:47:41,313 INFO L125 PetriNetUnfolderBase]: For 86708/86708 co-relation queries the response was YES. [2024-06-28 01:47:41,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34610 conditions, 5186 events. 2655/5186 cut-off events. For 86708/86708 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 40912 event pairs, 681 based on Foata normal form. 6/4969 useless extension candidates. Maximal degree in co-relation 34498. Up to 3879 conditions per place. [2024-06-28 01:47:41,374 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 467 selfloop transitions, 72 changer transitions 0/546 dead transitions. [2024-06-28 01:47:41,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 546 transitions, 9563 flow [2024-06-28 01:47:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 01:47:41,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-28 01:47:41,375 INFO L175 Difference]: Start difference. First operand has 245 places, 497 transitions, 8000 flow. Second operand 10 states and 184 transitions. [2024-06-28 01:47:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 546 transitions, 9563 flow [2024-06-28 01:47:41,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 546 transitions, 9406 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:41,631 INFO L231 Difference]: Finished difference. Result has 250 places, 503 transitions, 8133 flow [2024-06-28 01:47:41,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7863, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8133, PETRI_PLACES=250, PETRI_TRANSITIONS=503} [2024-06-28 01:47:41,632 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-28 01:47:41,632 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 503 transitions, 8133 flow [2024-06-28 01:47:41,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:41,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:41,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:41,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:47:41,633 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:41,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1545771349, now seen corresponding path program 10 times [2024-06-28 01:47:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329588686] [2024-06-28 01:47:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:42,291 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 01:47:42,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329588686] [2024-06-28 01:47:42,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329588686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129602735] [2024-06-28 01:47:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:42,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:42,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 503 transitions, 8133 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:42,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:42,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:42,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:43,638 INFO L124 PetriNetUnfolderBase]: 2651/5189 cut-off events. [2024-06-28 01:47:43,638 INFO L125 PetriNetUnfolderBase]: For 83921/83921 co-relation queries the response was YES. [2024-06-28 01:47:43,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34546 conditions, 5189 events. 2651/5189 cut-off events. For 83921/83921 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 40929 event pairs, 705 based on Foata normal form. 2/4966 useless extension candidates. Maximal degree in co-relation 34432. Up to 3695 conditions per place. [2024-06-28 01:47:43,691 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 449 selfloop transitions, 95 changer transitions 0/551 dead transitions. [2024-06-28 01:47:43,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 551 transitions, 9673 flow [2024-06-28 01:47:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:47:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:47:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 01:47:43,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-28 01:47:43,693 INFO L175 Difference]: Start difference. First operand has 250 places, 503 transitions, 8133 flow. Second operand 10 states and 188 transitions. [2024-06-28 01:47:43,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 551 transitions, 9673 flow [2024-06-28 01:47:43,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 551 transitions, 9469 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-28 01:47:43,927 INFO L231 Difference]: Finished difference. Result has 252 places, 503 transitions, 8130 flow [2024-06-28 01:47:43,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7929, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8130, PETRI_PLACES=252, PETRI_TRANSITIONS=503} [2024-06-28 01:47:43,928 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places. [2024-06-28 01:47:43,928 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 503 transitions, 8130 flow [2024-06-28 01:47:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:43,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:43,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:43,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:47:43,929 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:43,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash -420328341, now seen corresponding path program 11 times [2024-06-28 01:47:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480217485] [2024-06-28 01:47:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:44,781 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 01:47:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480217485] [2024-06-28 01:47:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480217485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618480045] [2024-06-28 01:47:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:44,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:44,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:44,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 503 transitions, 8130 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:44,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:44,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:44,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:45,966 INFO L124 PetriNetUnfolderBase]: 2652/5251 cut-off events. [2024-06-28 01:47:45,966 INFO L125 PetriNetUnfolderBase]: For 82516/82516 co-relation queries the response was YES. [2024-06-28 01:47:46,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34539 conditions, 5251 events. 2652/5251 cut-off events. For 82516/82516 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 41513 event pairs, 636 based on Foata normal form. 1/5009 useless extension candidates. Maximal degree in co-relation 34424. Up to 3898 conditions per place. [2024-06-28 01:47:46,024 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 497 selfloop transitions, 68 changer transitions 0/572 dead transitions. [2024-06-28 01:47:46,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 572 transitions, 10028 flow [2024-06-28 01:47:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 01:47:46,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-28 01:47:46,025 INFO L175 Difference]: Start difference. First operand has 252 places, 503 transitions, 8130 flow. Second operand 9 states and 159 transitions. [2024-06-28 01:47:46,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 572 transitions, 10028 flow [2024-06-28 01:47:46,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 572 transitions, 9859 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:46,292 INFO L231 Difference]: Finished difference. Result has 255 places, 529 transitions, 8565 flow [2024-06-28 01:47:46,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7961, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8565, PETRI_PLACES=255, PETRI_TRANSITIONS=529} [2024-06-28 01:47:46,292 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2024-06-28 01:47:46,293 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 529 transitions, 8565 flow [2024-06-28 01:47:46,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:46,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:46,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:46,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:47:46,293 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:46,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 998261908, now seen corresponding path program 2 times [2024-06-28 01:47:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:46,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383365273] [2024-06-28 01:47:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:47,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 01:47:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383365273] [2024-06-28 01:47:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383365273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774277483] [2024-06-28 01:47:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:47,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:47,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 529 transitions, 8565 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:47,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:47,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:47,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:48,733 INFO L124 PetriNetUnfolderBase]: 2716/5378 cut-off events. [2024-06-28 01:47:48,734 INFO L125 PetriNetUnfolderBase]: For 86658/86658 co-relation queries the response was YES. [2024-06-28 01:47:48,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35619 conditions, 5378 events. 2716/5378 cut-off events. For 86658/86658 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 42993 event pairs, 478 based on Foata normal form. 2/5114 useless extension candidates. Maximal degree in co-relation 35502. Up to 3158 conditions per place. [2024-06-28 01:47:48,786 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 383 selfloop transitions, 196 changer transitions 0/586 dead transitions. [2024-06-28 01:47:48,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 586 transitions, 10353 flow [2024-06-28 01:47:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:47:48,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:47:48,788 INFO L175 Difference]: Start difference. First operand has 255 places, 529 transitions, 8565 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:47:48,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 586 transitions, 10353 flow [2024-06-28 01:47:49,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 586 transitions, 10272 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:49,074 INFO L231 Difference]: Finished difference. Result has 259 places, 539 transitions, 8994 flow [2024-06-28 01:47:49,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8484, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8994, PETRI_PLACES=259, PETRI_TRANSITIONS=539} [2024-06-28 01:47:49,075 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2024-06-28 01:47:49,075 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 539 transitions, 8994 flow [2024-06-28 01:47:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:49,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:49,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:49,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:47:49,075 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:49,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash 998261691, now seen corresponding path program 12 times [2024-06-28 01:47:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:49,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172155343] [2024-06-28 01:47:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:49,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 01:47:49,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:49,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172155343] [2024-06-28 01:47:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172155343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:49,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307402362] [2024-06-28 01:47:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:49,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:50,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:50,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 539 transitions, 8994 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:50,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:50,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:50,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:51,311 INFO L124 PetriNetUnfolderBase]: 2789/5315 cut-off events. [2024-06-28 01:47:51,311 INFO L125 PetriNetUnfolderBase]: For 92861/92861 co-relation queries the response was YES. [2024-06-28 01:47:51,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36982 conditions, 5315 events. 2789/5315 cut-off events. For 92861/92861 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 41078 event pairs, 248 based on Foata normal form. 1/5095 useless extension candidates. Maximal degree in co-relation 36863. Up to 2659 conditions per place. [2024-06-28 01:47:51,380 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 420 selfloop transitions, 221 changer transitions 0/648 dead transitions. [2024-06-28 01:47:51,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 648 transitions, 11811 flow [2024-06-28 01:47:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 01:47:51,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:47:51,382 INFO L175 Difference]: Start difference. First operand has 259 places, 539 transitions, 8994 flow. Second operand 9 states and 171 transitions. [2024-06-28 01:47:51,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 648 transitions, 11811 flow [2024-06-28 01:47:51,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 648 transitions, 11655 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:51,688 INFO L231 Difference]: Finished difference. Result has 266 places, 585 transitions, 10276 flow [2024-06-28 01:47:51,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8838, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10276, PETRI_PLACES=266, PETRI_TRANSITIONS=585} [2024-06-28 01:47:51,689 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places. [2024-06-28 01:47:51,689 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 585 transitions, 10276 flow [2024-06-28 01:47:51,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:51,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:51,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:51,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:47:51,690 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:51,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 998256111, now seen corresponding path program 13 times [2024-06-28 01:47:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91166706] [2024-06-28 01:47:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:52,477 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 01:47:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91166706] [2024-06-28 01:47:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91166706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956975072] [2024-06-28 01:47:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:52,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:52,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:52,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 585 transitions, 10276 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:52,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:52,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:52,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:53,764 INFO L124 PetriNetUnfolderBase]: 2787/5313 cut-off events. [2024-06-28 01:47:53,765 INFO L125 PetriNetUnfolderBase]: For 100047/100047 co-relation queries the response was YES. [2024-06-28 01:47:53,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39256 conditions, 5313 events. 2787/5313 cut-off events. For 100047/100047 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 41090 event pairs, 244 based on Foata normal form. 1/5093 useless extension candidates. Maximal degree in co-relation 39132. Up to 2657 conditions per place. [2024-06-28 01:47:53,830 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 429 selfloop transitions, 210 changer transitions 0/646 dead transitions. [2024-06-28 01:47:53,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 646 transitions, 12324 flow [2024-06-28 01:47:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 01:47:53,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:47:53,831 INFO L175 Difference]: Start difference. First operand has 266 places, 585 transitions, 10276 flow. Second operand 9 states and 171 transitions. [2024-06-28 01:47:53,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 646 transitions, 12324 flow [2024-06-28 01:47:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 646 transitions, 12241 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-28 01:47:54,201 INFO L231 Difference]: Finished difference. Result has 273 places, 585 transitions, 10632 flow [2024-06-28 01:47:54,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10193, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10632, PETRI_PLACES=273, PETRI_TRANSITIONS=585} [2024-06-28 01:47:54,202 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2024-06-28 01:47:54,202 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 585 transitions, 10632 flow [2024-06-28 01:47:54,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:54,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:54,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:54,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:47:54,203 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:54,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1142146641, now seen corresponding path program 14 times [2024-06-28 01:47:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875338175] [2024-06-28 01:47:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:54,982 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 01:47:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875338175] [2024-06-28 01:47:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875338175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068342472] [2024-06-28 01:47:54,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:54,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:55,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:55,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 585 transitions, 10632 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:55,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:55,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:55,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:56,325 INFO L124 PetriNetUnfolderBase]: 2891/5655 cut-off events. [2024-06-28 01:47:56,326 INFO L125 PetriNetUnfolderBase]: For 114842/114842 co-relation queries the response was YES. [2024-06-28 01:47:56,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41815 conditions, 5655 events. 2891/5655 cut-off events. For 114842/114842 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 45290 event pairs, 574 based on Foata normal form. 1/5408 useless extension candidates. Maximal degree in co-relation 41689. Up to 3771 conditions per place. [2024-06-28 01:47:56,397 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 502 selfloop transitions, 152 changer transitions 0/661 dead transitions. [2024-06-28 01:47:56,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 661 transitions, 13011 flow [2024-06-28 01:47:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:47:56,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:47:56,398 INFO L175 Difference]: Start difference. First operand has 273 places, 585 transitions, 10632 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:47:56,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 661 transitions, 13011 flow [2024-06-28 01:47:56,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 661 transitions, 12525 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:47:56,782 INFO L231 Difference]: Finished difference. Result has 276 places, 604 transitions, 10911 flow [2024-06-28 01:47:56,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10174, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10911, PETRI_PLACES=276, PETRI_TRANSITIONS=604} [2024-06-28 01:47:56,783 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-28 01:47:56,783 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 604 transitions, 10911 flow [2024-06-28 01:47:56,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:56,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:56,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:56,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:47:56,784 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:56,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1142152221, now seen corresponding path program 15 times [2024-06-28 01:47:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931377845] [2024-06-28 01:47:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:47:57,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 01:47:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:47:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931377845] [2024-06-28 01:47:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931377845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:47:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:47:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:47:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306144641] [2024-06-28 01:47:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:47:57,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:47:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:47:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:47:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:47:57,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:47:57,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 604 transitions, 10911 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:57,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:47:57,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:47:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:47:58,957 INFO L124 PetriNetUnfolderBase]: 2922/5716 cut-off events. [2024-06-28 01:47:58,957 INFO L125 PetriNetUnfolderBase]: For 115264/115264 co-relation queries the response was YES. [2024-06-28 01:47:59,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42034 conditions, 5716 events. 2922/5716 cut-off events. For 115264/115264 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 45875 event pairs, 589 based on Foata normal form. 1/5466 useless extension candidates. Maximal degree in co-relation 41906. Up to 3807 conditions per place. [2024-06-28 01:47:59,033 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 516 selfloop transitions, 146 changer transitions 0/669 dead transitions. [2024-06-28 01:47:59,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 669 transitions, 13126 flow [2024-06-28 01:47:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:47:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:47:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:47:59,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:47:59,035 INFO L175 Difference]: Start difference. First operand has 276 places, 604 transitions, 10911 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:47:59,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 669 transitions, 13126 flow [2024-06-28 01:47:59,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 669 transitions, 12869 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-28 01:47:59,475 INFO L231 Difference]: Finished difference. Result has 280 places, 610 transitions, 11106 flow [2024-06-28 01:47:59,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10682, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11106, PETRI_PLACES=280, PETRI_TRANSITIONS=610} [2024-06-28 01:47:59,476 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places. [2024-06-28 01:47:59,476 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 610 transitions, 11106 flow [2024-06-28 01:47:59,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:47:59,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:47:59,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:47:59,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:47:59,477 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:47:59,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:47:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -272511351, now seen corresponding path program 16 times [2024-06-28 01:47:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:47:59,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638561224] [2024-06-28 01:47:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:47:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:47:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:00,297 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 01:48:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638561224] [2024-06-28 01:48:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638561224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491670142] [2024-06-28 01:48:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:00,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:00,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:00,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 610 transitions, 11106 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:00,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:00,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:00,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:01,579 INFO L124 PetriNetUnfolderBase]: 2916/5685 cut-off events. [2024-06-28 01:48:01,580 INFO L125 PetriNetUnfolderBase]: For 114864/114864 co-relation queries the response was YES. [2024-06-28 01:48:01,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42075 conditions, 5685 events. 2916/5685 cut-off events. For 114864/114864 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 45529 event pairs, 637 based on Foata normal form. 3/5443 useless extension candidates. Maximal degree in co-relation 41945. Up to 4052 conditions per place. [2024-06-28 01:48:01,656 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 543 selfloop transitions, 113 changer transitions 0/663 dead transitions. [2024-06-28 01:48:01,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 663 transitions, 12972 flow [2024-06-28 01:48:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:48:01,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:48:01,658 INFO L175 Difference]: Start difference. First operand has 280 places, 610 transitions, 11106 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:48:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 663 transitions, 12972 flow [2024-06-28 01:48:02,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 663 transitions, 12718 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:48:02,102 INFO L231 Difference]: Finished difference. Result has 283 places, 611 transitions, 11121 flow [2024-06-28 01:48:02,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10857, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11121, PETRI_PLACES=283, PETRI_TRANSITIONS=611} [2024-06-28 01:48:02,103 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 242 predicate places. [2024-06-28 01:48:02,104 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 611 transitions, 11121 flow [2024-06-28 01:48:02,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:02,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:02,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:02,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:48:02,104 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:02,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -272712944, now seen corresponding path program 3 times [2024-06-28 01:48:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152009985] [2024-06-28 01:48:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:02,952 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 01:48:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152009985] [2024-06-28 01:48:02,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152009985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:02,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:02,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550384525] [2024-06-28 01:48:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:02,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:03,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:03,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 611 transitions, 11121 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:03,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:03,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:03,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:04,388 INFO L124 PetriNetUnfolderBase]: 3014/5898 cut-off events. [2024-06-28 01:48:04,388 INFO L125 PetriNetUnfolderBase]: For 119308/119308 co-relation queries the response was YES. [2024-06-28 01:48:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42863 conditions, 5898 events. 3014/5898 cut-off events. For 119308/119308 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 47780 event pairs, 673 based on Foata normal form. 2/5639 useless extension candidates. Maximal degree in co-relation 42732. Up to 4097 conditions per place. [2024-06-28 01:48:04,467 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 542 selfloop transitions, 135 changer transitions 0/684 dead transitions. [2024-06-28 01:48:04,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 684 transitions, 13357 flow [2024-06-28 01:48:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-28 01:48:04,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-06-28 01:48:04,469 INFO L175 Difference]: Start difference. First operand has 283 places, 611 transitions, 11121 flow. Second operand 9 states and 167 transitions. [2024-06-28 01:48:04,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 684 transitions, 13357 flow [2024-06-28 01:48:04,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 684 transitions, 13152 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:04,893 INFO L231 Difference]: Finished difference. Result has 285 places, 625 transitions, 11374 flow [2024-06-28 01:48:04,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10916, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11374, PETRI_PLACES=285, PETRI_TRANSITIONS=625} [2024-06-28 01:48:04,897 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 244 predicate places. [2024-06-28 01:48:04,897 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 625 transitions, 11374 flow [2024-06-28 01:48:04,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:04,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:04,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:04,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:48:04,898 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:04,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -272511134, now seen corresponding path program 4 times [2024-06-28 01:48:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158504694] [2024-06-28 01:48:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:05,803 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 01:48:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158504694] [2024-06-28 01:48:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158504694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:05,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:05,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486789005] [2024-06-28 01:48:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:05,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:05,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:05,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 625 transitions, 11374 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:05,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:05,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:05,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:07,300 INFO L124 PetriNetUnfolderBase]: 3010/5854 cut-off events. [2024-06-28 01:48:07,301 INFO L125 PetriNetUnfolderBase]: For 119373/119373 co-relation queries the response was YES. [2024-06-28 01:48:07,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42883 conditions, 5854 events. 3010/5854 cut-off events. For 119373/119373 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 47144 event pairs, 698 based on Foata normal form. 2/5606 useless extension candidates. Maximal degree in co-relation 42751. Up to 4260 conditions per place. [2024-06-28 01:48:07,375 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 562 selfloop transitions, 109 changer transitions 0/678 dead transitions. [2024-06-28 01:48:07,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 678 transitions, 13257 flow [2024-06-28 01:48:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 01:48:07,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-06-28 01:48:07,377 INFO L175 Difference]: Start difference. First operand has 285 places, 625 transitions, 11374 flow. Second operand 9 states and 164 transitions. [2024-06-28 01:48:07,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 678 transitions, 13257 flow [2024-06-28 01:48:07,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 678 transitions, 13110 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-28 01:48:07,812 INFO L231 Difference]: Finished difference. Result has 289 places, 625 transitions, 11463 flow [2024-06-28 01:48:07,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11227, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11463, PETRI_PLACES=289, PETRI_TRANSITIONS=625} [2024-06-28 01:48:07,814 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 248 predicate places. [2024-06-28 01:48:07,814 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 625 transitions, 11463 flow [2024-06-28 01:48:07,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:07,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:07,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:07,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:48:07,814 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:07,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2079451329, now seen corresponding path program 1 times [2024-06-28 01:48:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592134022] [2024-06-28 01:48:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:08,782 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 01:48:08,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592134022] [2024-06-28 01:48:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592134022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498274977] [2024-06-28 01:48:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:08,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:08,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 625 transitions, 11463 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:08,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:08,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:10,210 INFO L124 PetriNetUnfolderBase]: 3011/5802 cut-off events. [2024-06-28 01:48:10,210 INFO L125 PetriNetUnfolderBase]: For 118147/118147 co-relation queries the response was YES. [2024-06-28 01:48:10,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43181 conditions, 5802 events. 3011/5802 cut-off events. For 118147/118147 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 46286 event pairs, 922 based on Foata normal form. 1/5569 useless extension candidates. Maximal degree in co-relation 43047. Up to 4712 conditions per place. [2024-06-28 01:48:10,287 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 622 selfloop transitions, 21 changer transitions 0/650 dead transitions. [2024-06-28 01:48:10,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 650 transitions, 12979 flow [2024-06-28 01:48:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:48:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:48:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:48:10,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-28 01:48:10,288 INFO L175 Difference]: Start difference. First operand has 289 places, 625 transitions, 11463 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:48:10,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 650 transitions, 12979 flow [2024-06-28 01:48:10,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 650 transitions, 12715 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:10,788 INFO L231 Difference]: Finished difference. Result has 291 places, 630 transitions, 11331 flow [2024-06-28 01:48:10,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11199, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11331, PETRI_PLACES=291, PETRI_TRANSITIONS=630} [2024-06-28 01:48:10,789 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places. [2024-06-28 01:48:10,789 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 630 transitions, 11331 flow [2024-06-28 01:48:10,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:10,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:10,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:10,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:48:10,790 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:10,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 910720652, now seen corresponding path program 5 times [2024-06-28 01:48:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337903008] [2024-06-28 01:48:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:11,627 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 01:48:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337903008] [2024-06-28 01:48:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337903008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824941794] [2024-06-28 01:48:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:11,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:11,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:11,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 630 transitions, 11331 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:11,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:11,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:13,162 INFO L124 PetriNetUnfolderBase]: 3047/5891 cut-off events. [2024-06-28 01:48:13,162 INFO L125 PetriNetUnfolderBase]: For 121988/121988 co-relation queries the response was YES. [2024-06-28 01:48:13,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43484 conditions, 5891 events. 3047/5891 cut-off events. For 121988/121988 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 47137 event pairs, 891 based on Foata normal form. 2/5651 useless extension candidates. Maximal degree in co-relation 43348. Up to 4622 conditions per place. [2024-06-28 01:48:13,240 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 624 selfloop transitions, 45 changer transitions 0/676 dead transitions. [2024-06-28 01:48:13,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 676 transitions, 13123 flow [2024-06-28 01:48:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 01:48:13,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-28 01:48:13,241 INFO L175 Difference]: Start difference. First operand has 291 places, 630 transitions, 11331 flow. Second operand 9 states and 153 transitions. [2024-06-28 01:48:13,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 676 transitions, 13123 flow [2024-06-28 01:48:13,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 676 transitions, 13059 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 01:48:13,750 INFO L231 Difference]: Finished difference. Result has 295 places, 636 transitions, 11466 flow [2024-06-28 01:48:13,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11267, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11466, PETRI_PLACES=295, PETRI_TRANSITIONS=636} [2024-06-28 01:48:13,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 254 predicate places. [2024-06-28 01:48:13,751 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 636 transitions, 11466 flow [2024-06-28 01:48:13,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:13,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:13,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:13,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:48:13,751 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:13,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 920818592, now seen corresponding path program 6 times [2024-06-28 01:48:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432959406] [2024-06-28 01:48:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:14,560 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 01:48:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432959406] [2024-06-28 01:48:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432959406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461158376] [2024-06-28 01:48:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:14,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:14,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 636 transitions, 11466 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:14,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:14,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:14,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:16,028 INFO L124 PetriNetUnfolderBase]: 3049/5873 cut-off events. [2024-06-28 01:48:16,028 INFO L125 PetriNetUnfolderBase]: For 121693/121693 co-relation queries the response was YES. [2024-06-28 01:48:16,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43537 conditions, 5873 events. 3049/5873 cut-off events. For 121693/121693 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 46876 event pairs, 932 based on Foata normal form. 2/5639 useless extension candidates. Maximal degree in co-relation 43400. Up to 4738 conditions per place. [2024-06-28 01:48:16,103 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 634 selfloop transitions, 23 changer transitions 0/664 dead transitions. [2024-06-28 01:48:16,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 664 transitions, 13032 flow [2024-06-28 01:48:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:48:16,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2024-06-28 01:48:16,105 INFO L175 Difference]: Start difference. First operand has 295 places, 636 transitions, 11466 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:48:16,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 664 transitions, 13032 flow [2024-06-28 01:48:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 664 transitions, 12916 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-28 01:48:16,595 INFO L231 Difference]: Finished difference. Result has 298 places, 638 transitions, 11436 flow [2024-06-28 01:48:16,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11350, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11436, PETRI_PLACES=298, PETRI_TRANSITIONS=638} [2024-06-28 01:48:16,596 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-06-28 01:48:16,596 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 638 transitions, 11436 flow [2024-06-28 01:48:16,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:16,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:16,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:16,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:48:16,597 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:16,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash -412971857, now seen corresponding path program 17 times [2024-06-28 01:48:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919729562] [2024-06-28 01:48:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:17,353 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 01:48:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919729562] [2024-06-28 01:48:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919729562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:17,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936915730] [2024-06-28 01:48:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:17,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:17,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 638 transitions, 11436 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:17,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:17,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:17,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:18,791 INFO L124 PetriNetUnfolderBase]: 3116/6023 cut-off events. [2024-06-28 01:48:18,792 INFO L125 PetriNetUnfolderBase]: For 127136/127136 co-relation queries the response was YES. [2024-06-28 01:48:18,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44388 conditions, 6023 events. 3116/6023 cut-off events. For 127136/127136 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 48451 event pairs, 902 based on Foata normal form. 3/5778 useless extension candidates. Maximal degree in co-relation 44250. Up to 4614 conditions per place. [2024-06-28 01:48:18,870 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 629 selfloop transitions, 64 changer transitions 0/700 dead transitions. [2024-06-28 01:48:18,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 700 transitions, 13564 flow [2024-06-28 01:48:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 01:48:18,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-28 01:48:18,875 INFO L175 Difference]: Start difference. First operand has 298 places, 638 transitions, 11436 flow. Second operand 9 states and 159 transitions. [2024-06-28 01:48:18,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 700 transitions, 13564 flow [2024-06-28 01:48:19,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 700 transitions, 13496 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:19,396 INFO L231 Difference]: Finished difference. Result has 300 places, 646 transitions, 11699 flow [2024-06-28 01:48:19,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11699, PETRI_PLACES=300, PETRI_TRANSITIONS=646} [2024-06-28 01:48:19,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-28 01:48:19,397 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 646 transitions, 11699 flow [2024-06-28 01:48:19,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:19,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:19,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:19,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:48:19,397 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:19,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2100393754, now seen corresponding path program 7 times [2024-06-28 01:48:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:19,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044678463] [2024-06-28 01:48:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:20,142 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 01:48:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044678463] [2024-06-28 01:48:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044678463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:20,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:20,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925470111] [2024-06-28 01:48:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:20,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:20,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:20,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 646 transitions, 11699 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:20,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:20,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:20,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:21,671 INFO L124 PetriNetUnfolderBase]: 3152/6107 cut-off events. [2024-06-28 01:48:21,671 INFO L125 PetriNetUnfolderBase]: For 130338/130338 co-relation queries the response was YES. [2024-06-28 01:48:21,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45086 conditions, 6107 events. 3152/6107 cut-off events. For 130338/130338 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 49317 event pairs, 911 based on Foata normal form. 2/5854 useless extension candidates. Maximal degree in co-relation 44947. Up to 4711 conditions per place. [2024-06-28 01:48:21,757 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 637 selfloop transitions, 62 changer transitions 0/706 dead transitions. [2024-06-28 01:48:21,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 706 transitions, 13747 flow [2024-06-28 01:48:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-28 01:48:21,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2024-06-28 01:48:21,769 INFO L175 Difference]: Start difference. First operand has 300 places, 646 transitions, 11699 flow. Second operand 9 states and 158 transitions. [2024-06-28 01:48:21,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 706 transitions, 13747 flow [2024-06-28 01:48:22,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 706 transitions, 13555 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:22,307 INFO L231 Difference]: Finished difference. Result has 302 places, 652 transitions, 11752 flow [2024-06-28 01:48:22,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11507, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11752, PETRI_PLACES=302, PETRI_TRANSITIONS=652} [2024-06-28 01:48:22,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 261 predicate places. [2024-06-28 01:48:22,308 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 652 transitions, 11752 flow [2024-06-28 01:48:22,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:22,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:22,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:22,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:48:22,308 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:22,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 910720435, now seen corresponding path program 18 times [2024-06-28 01:48:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:22,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707468052] [2024-06-28 01:48:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:23,026 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 01:48:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707468052] [2024-06-28 01:48:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707468052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149290550] [2024-06-28 01:48:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:23,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:23,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:23,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 652 transitions, 11752 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:23,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:23,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:23,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:24,561 INFO L124 PetriNetUnfolderBase]: 3179/6129 cut-off events. [2024-06-28 01:48:24,562 INFO L125 PetriNetUnfolderBase]: For 130435/130435 co-relation queries the response was YES. [2024-06-28 01:48:24,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45209 conditions, 6129 events. 3179/6129 cut-off events. For 130435/130435 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 49333 event pairs, 931 based on Foata normal form. 3/5884 useless extension candidates. Maximal degree in co-relation 45069. Up to 4789 conditions per place. [2024-06-28 01:48:24,642 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 644 selfloop transitions, 47 changer transitions 0/698 dead transitions. [2024-06-28 01:48:24,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 698 transitions, 13669 flow [2024-06-28 01:48:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:48:24,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-28 01:48:24,644 INFO L175 Difference]: Start difference. First operand has 302 places, 652 transitions, 11752 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:48:24,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 698 transitions, 13669 flow [2024-06-28 01:48:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 698 transitions, 13498 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:25,229 INFO L231 Difference]: Finished difference. Result has 304 places, 658 transitions, 11851 flow [2024-06-28 01:48:25,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11581, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11851, PETRI_PLACES=304, PETRI_TRANSITIONS=658} [2024-06-28 01:48:25,230 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 263 predicate places. [2024-06-28 01:48:25,230 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 658 transitions, 11851 flow [2024-06-28 01:48:25,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:25,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:25,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:25,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:48:25,231 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:25,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -413179247, now seen corresponding path program 19 times [2024-06-28 01:48:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489536279] [2024-06-28 01:48:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:26,109 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 01:48:26,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489536279] [2024-06-28 01:48:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489536279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:26,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753546311] [2024-06-28 01:48:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:26,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:26,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:26,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:26,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:26,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:26,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 658 transitions, 11851 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:26,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:26,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:26,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:27,691 INFO L124 PetriNetUnfolderBase]: 3210/6213 cut-off events. [2024-06-28 01:48:27,692 INFO L125 PetriNetUnfolderBase]: For 130739/130739 co-relation queries the response was YES. [2024-06-28 01:48:27,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45774 conditions, 6213 events. 3210/6213 cut-off events. For 130739/130739 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50247 event pairs, 854 based on Foata normal form. 1/5957 useless extension candidates. Maximal degree in co-relation 45633. Up to 4442 conditions per place. [2024-06-28 01:48:27,771 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 585 selfloop transitions, 120 changer transitions 0/712 dead transitions. [2024-06-28 01:48:27,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 712 transitions, 14040 flow [2024-06-28 01:48:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:48:27,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804804804804805 [2024-06-28 01:48:27,773 INFO L175 Difference]: Start difference. First operand has 304 places, 658 transitions, 11851 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:48:27,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 712 transitions, 14040 flow [2024-06-28 01:48:28,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 712 transitions, 13866 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:28,385 INFO L231 Difference]: Finished difference. Result has 306 places, 664 transitions, 12088 flow [2024-06-28 01:48:28,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11677, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12088, PETRI_PLACES=306, PETRI_TRANSITIONS=664} [2024-06-28 01:48:28,386 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places. [2024-06-28 01:48:28,386 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 664 transitions, 12088 flow [2024-06-28 01:48:28,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:28,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:28,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:48:28,386 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:28,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 626306750, now seen corresponding path program 1 times [2024-06-28 01:48:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125911500] [2024-06-28 01:48:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:29,190 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 01:48:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125911500] [2024-06-28 01:48:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125911500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:48:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555793876] [2024-06-28 01:48:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:48:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:48:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:48:29,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:29,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 664 transitions, 12088 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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 01:48:29,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:29,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:29,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:30,663 INFO L124 PetriNetUnfolderBase]: 3208/6204 cut-off events. [2024-06-28 01:48:30,664 INFO L125 PetriNetUnfolderBase]: For 130618/130618 co-relation queries the response was YES. [2024-06-28 01:48:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45768 conditions, 6204 events. 3208/6204 cut-off events. For 130618/130618 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50173 event pairs, 955 based on Foata normal form. 1/5949 useless extension candidates. Maximal degree in co-relation 45626. Up to 4975 conditions per place. [2024-06-28 01:48:30,743 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 639 selfloop transitions, 43 changer transitions 0/689 dead transitions. [2024-06-28 01:48:30,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 689 transitions, 13682 flow [2024-06-28 01:48:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:48:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:48:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 01:48:30,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-28 01:48:30,744 INFO L175 Difference]: Start difference. First operand has 306 places, 664 transitions, 12088 flow. Second operand 8 states and 134 transitions. [2024-06-28 01:48:30,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 689 transitions, 13682 flow [2024-06-28 01:48:31,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 689 transitions, 13084 flow, removed 70 selfloop flow, removed 9 redundant places. [2024-06-28 01:48:31,373 INFO L231 Difference]: Finished difference. Result has 305 places, 664 transitions, 11599 flow [2024-06-28 01:48:31,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11490, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11599, PETRI_PLACES=305, PETRI_TRANSITIONS=664} [2024-06-28 01:48:31,373 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places. [2024-06-28 01:48:31,373 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 664 transitions, 11599 flow [2024-06-28 01:48:31,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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 01:48:31,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:31,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:31,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:48:31,374 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:31,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1505774605, now seen corresponding path program 20 times [2024-06-28 01:48:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919432496] [2024-06-28 01:48:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:32,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 01:48:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919432496] [2024-06-28 01:48:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919432496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074750004] [2024-06-28 01:48:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:32,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:32,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:32,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 664 transitions, 11599 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:32,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:32,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:32,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:33,733 INFO L124 PetriNetUnfolderBase]: 3206/6211 cut-off events. [2024-06-28 01:48:33,734 INFO L125 PetriNetUnfolderBase]: For 123998/123998 co-relation queries the response was YES. [2024-06-28 01:48:33,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44147 conditions, 6211 events. 3206/6211 cut-off events. For 123998/123998 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50297 event pairs, 864 based on Foata normal form. 1/5954 useless extension candidates. Maximal degree in co-relation 44006. Up to 4437 conditions per place. [2024-06-28 01:48:33,815 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 603 selfloop transitions, 103 changer transitions 0/713 dead transitions. [2024-06-28 01:48:33,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 713 transitions, 13565 flow [2024-06-28 01:48:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-28 01:48:33,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2024-06-28 01:48:33,823 INFO L175 Difference]: Start difference. First operand has 305 places, 664 transitions, 11599 flow. Second operand 9 states and 158 transitions. [2024-06-28 01:48:33,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 713 transitions, 13565 flow [2024-06-28 01:48:34,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 713 transitions, 13318 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:34,418 INFO L231 Difference]: Finished difference. Result has 307 places, 664 transitions, 11572 flow [2024-06-28 01:48:34,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11352, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11572, PETRI_PLACES=307, PETRI_TRANSITIONS=664} [2024-06-28 01:48:34,423 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places. [2024-06-28 01:48:34,423 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 664 transitions, 11572 flow [2024-06-28 01:48:34,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:34,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:34,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:34,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:48:34,423 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:34,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -413173450, now seen corresponding path program 8 times [2024-06-28 01:48:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872303626] [2024-06-28 01:48:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:35,275 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 01:48:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872303626] [2024-06-28 01:48:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872303626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127935921] [2024-06-28 01:48:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:35,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:35,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:35,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 664 transitions, 11572 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:35,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:35,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:35,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:36,870 INFO L124 PetriNetUnfolderBase]: 3202/6240 cut-off events. [2024-06-28 01:48:36,870 INFO L125 PetriNetUnfolderBase]: For 122513/122513 co-relation queries the response was YES. [2024-06-28 01:48:36,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44260 conditions, 6240 events. 3202/6240 cut-off events. For 122513/122513 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50737 event pairs, 878 based on Foata normal form. 2/5973 useless extension candidates. Maximal degree in co-relation 44118. Up to 4562 conditions per place. [2024-06-28 01:48:36,953 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 605 selfloop transitions, 99 changer transitions 0/711 dead transitions. [2024-06-28 01:48:36,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 711 transitions, 13459 flow [2024-06-28 01:48:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:48:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:48:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 01:48:36,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-06-28 01:48:36,954 INFO L175 Difference]: Start difference. First operand has 307 places, 664 transitions, 11572 flow. Second operand 9 states and 157 transitions. [2024-06-28 01:48:36,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 711 transitions, 13459 flow [2024-06-28 01:48:37,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 711 transitions, 13175 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:37,573 INFO L231 Difference]: Finished difference. Result has 308 places, 664 transitions, 11499 flow [2024-06-28 01:48:37,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11288, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11499, PETRI_PLACES=308, PETRI_TRANSITIONS=664} [2024-06-28 01:48:37,573 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2024-06-28 01:48:37,574 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 664 transitions, 11499 flow [2024-06-28 01:48:37,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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 01:48:37,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:37,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:37,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:48:37,574 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:37,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash 520854174, now seen corresponding path program 1 times [2024-06-28 01:48:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102134149] [2024-06-28 01:48:37,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:37,643 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 01:48:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102134149] [2024-06-28 01:48:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102134149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:48:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218024345] [2024-06-28 01:48:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:37,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:48:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:48:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:48:37,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:48:37,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 664 transitions, 11499 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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 01:48:37,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:37,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:48:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:39,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][274], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 11#L848true, Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 379#true, Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1104#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 646#true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, 28#L781true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,018 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-28 01:48:39,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 01:48:39,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 01:48:39,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 01:48:39,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][274], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), 379#true, Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1104#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 26#L19-1true, Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, 28#L781true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,263 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,263 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,263 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,263 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][840], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), 30#L19-5true, Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1108#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 108#true, P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 379#true, Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 646#true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 28#L781true, 175#true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,338 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,339 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][274], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 108#true, P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 379#true, Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1104#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 26#L19-1true, Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 646#true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 28#L781true, 175#true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,340 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,340 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 01:48:39,541 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][840], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), 30#L19-5true, Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1108#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), 379#true, Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, 28#L781true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,541 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,542 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,542 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,542 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,542 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][274], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), 379#true, Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1104#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, 28#L781true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 3#L19-2true, 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,543 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,543 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,543 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,543 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,592 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][274], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 24#L791true, Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), 379#true, Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1104#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 463#true, Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 28#L781true, 175#true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 3#L19-2true, 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,592 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,593 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,593 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,593 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,593 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([345] L752-->L768: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_59 256) 0))) (let ((.cse8 (not .cse6)) (.cse11 (= (mod v_~x$w_buff0_used~0_90 256) 0)) (.cse1 (and .cse6 .cse10)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_77 256) 0) .cse6))) (let ((.cse4 (or .cse11 .cse1 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_76 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_89 256) 0))) (and (= v_~x$w_buff1_used~0_76 (ite .cse0 v_~x$w_buff1_used~0_77 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_77 0))) (= (ite .cse0 v_~x$mem_tmp~0_24 v_~__unbuffered_p0_EAX~0_16) v_~x~0_54) (= v_~x~0_55 v_~x$mem_tmp~0_24) (= v_~x$w_buff1~0_31 v_~x$w_buff1~0_30) (= (ite .cse0 v_~x$w_buff0_used~0_90 (ite .cse4 v_~x$w_buff0_used~0_90 (ite .cse5 0 v_~x$w_buff0_used~0_90))) v_~x$w_buff0_used~0_89) (or (= v_~weak$$choice0~0_18 1) (= v_~weak$$choice0~0_18 0)) (= v_~x$r_buff0_thd1~0_58 (ite .cse0 v_~x$r_buff0_thd1~0_59 (ite (or (and .cse6 .cse7) .cse1 .cse2) v_~x$r_buff0_thd1~0_59 (ite (and .cse8 (not .cse2)) 0 v_~x$r_buff0_thd1~0_59)))) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x$w_buff0~0_36 v_~x$w_buff0~0_35) (= (ite .cse4 v_~x~0_55 (ite .cse5 v_~x$w_buff0~0_36 v_~x$w_buff1~0_31)) v_~__unbuffered_p0_EAX~0_16) (= v_~x$flush_delayed~0_28 0) (= v_~x$r_buff1_thd1~0_49 (ite .cse0 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_58 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~x$r_buff1_thd1~0_50 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_90} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_58, ~x$flush_delayed~0=v_~x$flush_delayed~0_28, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet4#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3#1, ~weak$$choice2~0, ~x~0][960], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), 30#L19-5true, Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1108#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 379#true, Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, 23#L817true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 17#L768true, Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,637 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,638 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,638 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,638 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L817-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_1| 0) (= |v_P1Thread1of1ForFork0_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_1|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base][1176], [Black: 1024#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~x$mem_tmp~0 0))), 30#L19-5true, Black: 766#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 767#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1108#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1035#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 271#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 783#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 536#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 121#true, Black: 1052#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 800#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 283#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 550#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 108#true, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse, Black: 1066#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 40#P1EXITtrue, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 227#true, Black: 815#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 609#true, Black: 814#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 1081#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1)))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 163#true, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 835#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))))) (= ~__unbuffered_p1_EAX~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1)) (= ~x~0 1)) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 586#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 578#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1102#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~x$mem_tmp~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 844#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 846#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 843#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 845#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 730#true, Black: 337#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 92#(and (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (<= ~x$r_buff0_thd2~0 (* (div ~x$r_buff0_thd2~0 256) 256)) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (<= 0 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 379#true, Black: 598#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 604#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 862#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 8#L752true, 316#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 363#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 874#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), Black: 875#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 666#true, 758#true, Black: 626#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~x$mem_tmp~0 0)), Black: 615#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 1087#true, Black: 889#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 1))), 279#true, 451#true, Black: 131#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), Black: 125#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 902#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 906#true, Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 837#true, 147#true, Black: 919#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (or (= ~__unbuffered_p1_EBX~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (or (not (= ~__unbuffered_p1_EBX~0 1)) (= ~__unbuffered_p0_EAX~0 1))), Black: 651#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 663#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 415#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 463#true, Black: 934#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0)) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 169#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~x~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), 646#true, Black: 691#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (= ~x$mem_tmp~0 1)) (and (= ~x~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0))) (= ~y~0 1)), Black: 670#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), Black: 685#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (or (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 ~x~0)) (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0)), 175#true, Black: 945#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 367#true, Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 713#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 459#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 973#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (or (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p0_EAX~0 ~x$mem_tmp~0)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~__unbuffered_p1_EBX~0 ~x$mem_tmp~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1)), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 724#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~__unbuffered_p0_EBX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 471#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), 392#true, 333#true, Black: 984#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (= ~x$mem_tmp~0 0)), 205#true, Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 736#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$mem_tmp~0 0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 738#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 822#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1003#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~__unbuffered_p0_EAX~0 0))) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 496#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 754#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$r_buff1_thd0~0 0) (or (and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (= ~x~0 0) (= ~x~0 1))) (and (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 508#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (<= 0 (div ~x$r_buff1_thd2~0 256)) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= ~x$flush_delayed~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (<= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0))]) [2024-06-28 01:48:39,639 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,639 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,639 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,639 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:48:39,725 INFO L124 PetriNetUnfolderBase]: 5614/9530 cut-off events. [2024-06-28 01:48:39,725 INFO L125 PetriNetUnfolderBase]: For 145137/145430 co-relation queries the response was YES. [2024-06-28 01:48:39,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67185 conditions, 9530 events. 5614/9530 cut-off events. For 145137/145430 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 70486 event pairs, 1304 based on Foata normal form. 189/9241 useless extension candidates. Maximal degree in co-relation 67043. Up to 5889 conditions per place. [2024-06-28 01:48:39,852 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 798 selfloop transitions, 39 changer transitions 308/1344 dead transitions. [2024-06-28 01:48:39,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1344 transitions, 25102 flow [2024-06-28 01:48:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:48:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:48:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-28 01:48:39,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2024-06-28 01:48:39,854 INFO L175 Difference]: Start difference. First operand has 308 places, 664 transitions, 11499 flow. Second operand 8 states and 174 transitions. [2024-06-28 01:48:39,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1344 transitions, 25102 flow [2024-06-28 01:48:40,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1344 transitions, 23803 flow, removed 76 selfloop flow, removed 10 redundant places. [2024-06-28 01:48:40,565 INFO L231 Difference]: Finished difference. Result has 311 places, 669 transitions, 11055 flow [2024-06-28 01:48:40,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10844, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11055, PETRI_PLACES=311, PETRI_TRANSITIONS=669} [2024-06-28 01:48:40,566 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places. [2024-06-28 01:48:40,566 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 669 transitions, 11055 flow [2024-06-28 01:48:40,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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 01:48:40,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:40,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 01:48:40,567 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:40,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1261028324, now seen corresponding path program 1 times [2024-06-28 01:48:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784018689] [2024-06-28 01:48:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:41,465 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 01:48:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784018689] [2024-06-28 01:48:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784018689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:41,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187954667] [2024-06-28 01:48:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:41,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:41,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 669 transitions, 11055 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:41,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:41,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:43,169 INFO L124 PetriNetUnfolderBase]: 3229/6370 cut-off events. [2024-06-28 01:48:43,170 INFO L125 PetriNetUnfolderBase]: For 121291/121310 co-relation queries the response was YES. [2024-06-28 01:48:43,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45132 conditions, 6370 events. 3229/6370 cut-off events. For 121291/121310 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 51922 event pairs, 717 based on Foata normal form. 13/6369 useless extension candidates. Maximal degree in co-relation 44986. Up to 4693 conditions per place. [2024-06-28 01:48:43,256 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 632 selfloop transitions, 81 changer transitions 2/723 dead transitions. [2024-06-28 01:48:43,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 723 transitions, 12957 flow [2024-06-28 01:48:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2024-06-28 01:48:43,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:48:43,257 INFO L175 Difference]: Start difference. First operand has 311 places, 669 transitions, 11055 flow. Second operand 12 states and 210 transitions. [2024-06-28 01:48:43,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 723 transitions, 12957 flow [2024-06-28 01:48:43,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 723 transitions, 12935 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-28 01:48:43,870 INFO L231 Difference]: Finished difference. Result has 319 places, 668 transitions, 11227 flow [2024-06-28 01:48:43,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11047, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11227, PETRI_PLACES=319, PETRI_TRANSITIONS=668} [2024-06-28 01:48:43,871 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-28 01:48:43,871 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 668 transitions, 11227 flow [2024-06-28 01:48:43,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:43,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:43,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:43,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 01:48:43,872 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:43,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash 253009542, now seen corresponding path program 2 times [2024-06-28 01:48:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538362642] [2024-06-28 01:48:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48: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 01:48:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538362642] [2024-06-28 01:48:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538362642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990826261] [2024-06-28 01:48:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:44,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:44,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:44,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 668 transitions, 11227 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:44,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:44,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:44,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:46,051 INFO L124 PetriNetUnfolderBase]: 3273/6430 cut-off events. [2024-06-28 01:48:46,051 INFO L125 PetriNetUnfolderBase]: For 125994/126014 co-relation queries the response was YES. [2024-06-28 01:48:46,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45355 conditions, 6430 events. 3273/6430 cut-off events. For 125994/126014 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 52358 event pairs, 700 based on Foata normal form. 14/6423 useless extension candidates. Maximal degree in co-relation 45207. Up to 4674 conditions per place. [2024-06-28 01:48:46,157 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 635 selfloop transitions, 84 changer transitions 0/727 dead transitions. [2024-06-28 01:48:46,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 727 transitions, 13176 flow [2024-06-28 01:48:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:48:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:48:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-06-28 01:48:46,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-06-28 01:48:46,160 INFO L175 Difference]: Start difference. First operand has 319 places, 668 transitions, 11227 flow. Second operand 12 states and 213 transitions. [2024-06-28 01:48:46,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 727 transitions, 13176 flow [2024-06-28 01:48:46,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 727 transitions, 12932 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-28 01:48:46,767 INFO L231 Difference]: Finished difference. Result has 319 places, 671 transitions, 11219 flow [2024-06-28 01:48:46,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10983, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11219, PETRI_PLACES=319, PETRI_TRANSITIONS=671} [2024-06-28 01:48:46,781 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-28 01:48:46,782 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 671 transitions, 11219 flow [2024-06-28 01:48:46,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:46,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:46,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:46,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 01:48:46,782 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:46,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash -25947698, now seen corresponding path program 3 times [2024-06-28 01:48:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:46,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108588204] [2024-06-28 01:48:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:47,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 01:48:47,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:47,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108588204] [2024-06-28 01:48:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108588204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018081215] [2024-06-28 01:48:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:47,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:47,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:47,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 671 transitions, 11219 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:47,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:47,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:47,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:49,079 INFO L124 PetriNetUnfolderBase]: 3403/6664 cut-off events. [2024-06-28 01:48:49,080 INFO L125 PetriNetUnfolderBase]: For 135712/135732 co-relation queries the response was YES. [2024-06-28 01:48:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46844 conditions, 6664 events. 3403/6664 cut-off events. For 135712/135732 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 54447 event pairs, 680 based on Foata normal form. 14/6645 useless extension candidates. Maximal degree in co-relation 46696. Up to 4678 conditions per place. [2024-06-28 01:48:49,178 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 636 selfloop transitions, 88 changer transitions 0/732 dead transitions. [2024-06-28 01:48:49,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 732 transitions, 13380 flow [2024-06-28 01:48:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:48:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:48:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-28 01:48:49,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157248157248156 [2024-06-28 01:48:49,180 INFO L175 Difference]: Start difference. First operand has 319 places, 671 transitions, 11219 flow. Second operand 11 states and 196 transitions. [2024-06-28 01:48:49,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 732 transitions, 13380 flow [2024-06-28 01:48:49,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 732 transitions, 13215 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-28 01:48:49,827 INFO L231 Difference]: Finished difference. Result has 324 places, 680 transitions, 11445 flow [2024-06-28 01:48:49,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11082, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11445, PETRI_PLACES=324, PETRI_TRANSITIONS=680} [2024-06-28 01:48:49,828 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2024-06-28 01:48:49,828 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 680 transitions, 11445 flow [2024-06-28 01:48:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:49,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:49,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 01:48:49,829 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:49,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2147040192, now seen corresponding path program 1 times [2024-06-28 01:48:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935297542] [2024-06-28 01:48:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:50,734 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 01:48:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935297542] [2024-06-28 01:48:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935297542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:48:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618246054] [2024-06-28 01:48:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:48:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:48:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:48:50,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:50,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 680 transitions, 11445 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:50,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:50,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:50,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:52,676 INFO L124 PetriNetUnfolderBase]: 3459/6897 cut-off events. [2024-06-28 01:48:52,677 INFO L125 PetriNetUnfolderBase]: For 145223/145249 co-relation queries the response was YES. [2024-06-28 01:48:52,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48121 conditions, 6897 events. 3459/6897 cut-off events. For 145223/145249 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 57959 event pairs, 865 based on Foata normal form. 16/6899 useless extension candidates. Maximal degree in co-relation 47969. Up to 5178 conditions per place. [2024-06-28 01:48:52,779 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 704 selfloop transitions, 62 changer transitions 0/774 dead transitions. [2024-06-28 01:48:52,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 774 transitions, 14347 flow [2024-06-28 01:48:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:48:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:48:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2024-06-28 01:48:52,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698544698544699 [2024-06-28 01:48:52,780 INFO L175 Difference]: Start difference. First operand has 324 places, 680 transitions, 11445 flow. Second operand 13 states and 226 transitions. [2024-06-28 01:48:52,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 774 transitions, 14347 flow [2024-06-28 01:48:53,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 774 transitions, 14169 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-28 01:48:53,483 INFO L231 Difference]: Finished difference. Result has 333 places, 717 transitions, 12175 flow [2024-06-28 01:48:53,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11289, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12175, PETRI_PLACES=333, PETRI_TRANSITIONS=717} [2024-06-28 01:48:53,484 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places. [2024-06-28 01:48:53,484 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 717 transitions, 12175 flow [2024-06-28 01:48:53,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:53,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:53,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 01:48:53,484 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:53,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -509493626, now seen corresponding path program 4 times [2024-06-28 01:48:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:53,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711412788] [2024-06-28 01:48:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:54,235 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 01:48:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711412788] [2024-06-28 01:48:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711412788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:54,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649559272] [2024-06-28 01:48:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:54,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:54,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:54,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 717 transitions, 12175 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:54,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:54,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:56,062 INFO L124 PetriNetUnfolderBase]: 3623/7225 cut-off events. [2024-06-28 01:48:56,063 INFO L125 PetriNetUnfolderBase]: For 164907/164930 co-relation queries the response was YES. [2024-06-28 01:48:56,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51343 conditions, 7225 events. 3623/7225 cut-off events. For 164907/164930 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 61193 event pairs, 854 based on Foata normal form. 15/7204 useless extension candidates. Maximal degree in co-relation 51187. Up to 5283 conditions per place. [2024-06-28 01:48:56,173 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 694 selfloop transitions, 82 changer transitions 0/784 dead transitions. [2024-06-28 01:48:56,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 784 transitions, 14547 flow [2024-06-28 01:48:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:48:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:48:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-06-28 01:48:56,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:48:56,175 INFO L175 Difference]: Start difference. First operand has 333 places, 717 transitions, 12175 flow. Second operand 11 states and 198 transitions. [2024-06-28 01:48:56,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 784 transitions, 14547 flow [2024-06-28 01:48:56,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 784 transitions, 14313 flow, removed 108 selfloop flow, removed 3 redundant places. [2024-06-28 01:48:56,899 INFO L231 Difference]: Finished difference. Result has 342 places, 728 transitions, 12363 flow [2024-06-28 01:48:56,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11999, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12363, PETRI_PLACES=342, PETRI_TRANSITIONS=728} [2024-06-28 01:48:56,900 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places. [2024-06-28 01:48:56,900 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 728 transitions, 12363 flow [2024-06-28 01:48:56,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:56,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:48:56,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:48:56,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 01:48:56,901 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:48:56,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:48:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1281052382, now seen corresponding path program 2 times [2024-06-28 01:48:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:48:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034461798] [2024-06-28 01:48:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:48:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:48:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:48:57,688 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 01:48:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:48:57,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034461798] [2024-06-28 01:48:57,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034461798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:48:57,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:48:57,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:48:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299608470] [2024-06-28 01:48:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:48:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:48:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:48:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:48:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:48:57,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:48:57,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 728 transitions, 12363 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:48:57,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:48:57,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:48:57,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:48:59,816 INFO L124 PetriNetUnfolderBase]: 3721/7415 cut-off events. [2024-06-28 01:48:59,817 INFO L125 PetriNetUnfolderBase]: For 176869/176898 co-relation queries the response was YES. [2024-06-28 01:48:59,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52680 conditions, 7415 events. 3721/7415 cut-off events. For 176869/176898 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 62866 event pairs, 839 based on Foata normal form. 25/7429 useless extension candidates. Maximal degree in co-relation 52521. Up to 5215 conditions per place. [2024-06-28 01:48:59,907 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 667 selfloop transitions, 130 changer transitions 0/805 dead transitions. [2024-06-28 01:48:59,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 805 transitions, 14902 flow [2024-06-28 01:48:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:48:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:48:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 01:48:59,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:48:59,908 INFO L175 Difference]: Start difference. First operand has 342 places, 728 transitions, 12363 flow. Second operand 10 states and 185 transitions. [2024-06-28 01:48:59,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 805 transitions, 14902 flow [2024-06-28 01:49:00,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 805 transitions, 14791 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:00,664 INFO L231 Difference]: Finished difference. Result has 346 places, 743 transitions, 12785 flow [2024-06-28 01:49:00,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12256, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12785, PETRI_PLACES=346, PETRI_TRANSITIONS=743} [2024-06-28 01:49:00,664 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 305 predicate places. [2024-06-28 01:49:00,665 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 743 transitions, 12785 flow [2024-06-28 01:49:00,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:00,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:00,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:00,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 01:49:00,665 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:00,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1969806658, now seen corresponding path program 5 times [2024-06-28 01:49:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571055660] [2024-06-28 01:49:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:01,530 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 01:49:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571055660] [2024-06-28 01:49:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571055660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:49:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523992169] [2024-06-28 01:49:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:49:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:49:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:49:01,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:01,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 743 transitions, 12785 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:01,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:01,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:01,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:03,683 INFO L124 PetriNetUnfolderBase]: 3718/7449 cut-off events. [2024-06-28 01:49:03,683 INFO L125 PetriNetUnfolderBase]: For 172885/172910 co-relation queries the response was YES. [2024-06-28 01:49:03,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53243 conditions, 7449 events. 3718/7449 cut-off events. For 172885/172910 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 63652 event pairs, 957 based on Foata normal form. 17/7442 useless extension candidates. Maximal degree in co-relation 53081. Up to 5623 conditions per place. [2024-06-28 01:49:03,787 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 715 selfloop transitions, 74 changer transitions 0/797 dead transitions. [2024-06-28 01:49:03,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 797 transitions, 14818 flow [2024-06-28 01:49:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:49:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:49:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2024-06-28 01:49:03,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2024-06-28 01:49:03,789 INFO L175 Difference]: Start difference. First operand has 346 places, 743 transitions, 12785 flow. Second operand 12 states and 207 transitions. [2024-06-28 01:49:03,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 797 transitions, 14818 flow [2024-06-28 01:49:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 797 transitions, 14618 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-28 01:49:04,503 INFO L231 Difference]: Finished difference. Result has 356 places, 752 transitions, 12886 flow [2024-06-28 01:49:04,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12585, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12886, PETRI_PLACES=356, PETRI_TRANSITIONS=752} [2024-06-28 01:49:04,504 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 315 predicate places. [2024-06-28 01:49:04,504 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 752 transitions, 12886 flow [2024-06-28 01:49:04,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:04,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:04,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:04,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 01:49:04,505 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:04,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224092, now seen corresponding path program 6 times [2024-06-28 01:49:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064181479] [2024-06-28 01:49:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:05,414 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 01:49:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064181479] [2024-06-28 01:49:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064181479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:05,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:05,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386822093] [2024-06-28 01:49:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:05,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:05,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:05,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 752 transitions, 12886 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:05,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:05,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:07,478 INFO L124 PetriNetUnfolderBase]: 3738/7387 cut-off events. [2024-06-28 01:49:07,479 INFO L125 PetriNetUnfolderBase]: For 176361/176454 co-relation queries the response was YES. [2024-06-28 01:49:07,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53429 conditions, 7387 events. 3738/7387 cut-off events. For 176361/176454 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 61852 event pairs, 709 based on Foata normal form. 84/7449 useless extension candidates. Maximal degree in co-relation 53263. Up to 5138 conditions per place. [2024-06-28 01:49:07,594 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 643 selfloop transitions, 154 changer transitions 0/805 dead transitions. [2024-06-28 01:49:07,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 805 transitions, 14998 flow [2024-06-28 01:49:07,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:49:07,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:49:07,596 INFO L175 Difference]: Start difference. First operand has 356 places, 752 transitions, 12886 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:49:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 805 transitions, 14998 flow [2024-06-28 01:49:08,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 805 transitions, 14889 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:08,571 INFO L231 Difference]: Finished difference. Result has 360 places, 753 transitions, 13116 flow [2024-06-28 01:49:08,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12777, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13116, PETRI_PLACES=360, PETRI_TRANSITIONS=753} [2024-06-28 01:49:08,572 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 319 predicate places. [2024-06-28 01:49:08,572 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 753 transitions, 13116 flow [2024-06-28 01:49:08,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:08,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:08,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 01:49:08,573 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:08,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1242927846, now seen corresponding path program 3 times [2024-06-28 01:49:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425517772] [2024-06-28 01:49:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:09,298 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 01:49:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425517772] [2024-06-28 01:49:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425517772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442806195] [2024-06-28 01:49:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:09,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:09,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 753 transitions, 13116 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:09,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:09,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:09,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:11,477 INFO L124 PetriNetUnfolderBase]: 4007/7597 cut-off events. [2024-06-28 01:49:11,477 INFO L125 PetriNetUnfolderBase]: For 207656/207692 co-relation queries the response was YES. [2024-06-28 01:49:11,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56941 conditions, 7597 events. 4007/7597 cut-off events. For 207656/207692 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 62019 event pairs, 574 based on Foata normal form. 25/7568 useless extension candidates. Maximal degree in co-relation 56774. Up to 1894 conditions per place. [2024-06-28 01:49:11,591 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 579 selfloop transitions, 283 changer transitions 0/870 dead transitions. [2024-06-28 01:49:11,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 870 transitions, 16667 flow [2024-06-28 01:49:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-28 01:49:11,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2024-06-28 01:49:11,593 INFO L175 Difference]: Start difference. First operand has 360 places, 753 transitions, 13116 flow. Second operand 10 states and 208 transitions. [2024-06-28 01:49:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 870 transitions, 16667 flow [2024-06-28 01:49:12,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 870 transitions, 16338 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:49:12,588 INFO L231 Difference]: Finished difference. Result has 363 places, 780 transitions, 13929 flow [2024-06-28 01:49:12,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12795, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13929, PETRI_PLACES=363, PETRI_TRANSITIONS=780} [2024-06-28 01:49:12,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 322 predicate places. [2024-06-28 01:49:12,589 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 780 transitions, 13929 flow [2024-06-28 01:49:12,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:12,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:12,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:12,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 01:49:12,593 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:12,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2097819344, now seen corresponding path program 4 times [2024-06-28 01:49:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589223254] [2024-06-28 01:49:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:13,704 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 01:49:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589223254] [2024-06-28 01:49:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589223254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:49:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621536250] [2024-06-28 01:49:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:13,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:49:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:49:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:49:13,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:13,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 780 transitions, 13929 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:13,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:13,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:13,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:16,303 INFO L124 PetriNetUnfolderBase]: 4047/7843 cut-off events. [2024-06-28 01:49:16,304 INFO L125 PetriNetUnfolderBase]: For 220152/220235 co-relation queries the response was YES. [2024-06-28 01:49:16,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59097 conditions, 7843 events. 4047/7843 cut-off events. For 220152/220235 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 65579 event pairs, 595 based on Foata normal form. 61/7876 useless extension candidates. Maximal degree in co-relation 58928. Up to 3955 conditions per place. [2024-06-28 01:49:16,417 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 637 selfloop transitions, 288 changer transitions 0/933 dead transitions. [2024-06-28 01:49:16,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 933 transitions, 17801 flow [2024-06-28 01:49:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 01:49:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 01:49:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 281 transitions. [2024-06-28 01:49:16,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063063063063064 [2024-06-28 01:49:16,419 INFO L175 Difference]: Start difference. First operand has 363 places, 780 transitions, 13929 flow. Second operand 15 states and 281 transitions. [2024-06-28 01:49:16,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 933 transitions, 17801 flow [2024-06-28 01:49:17,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 933 transitions, 17636 flow, removed 75 selfloop flow, removed 2 redundant places. [2024-06-28 01:49:17,383 INFO L231 Difference]: Finished difference. Result has 381 places, 837 transitions, 15396 flow [2024-06-28 01:49:17,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13818, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15396, PETRI_PLACES=381, PETRI_TRANSITIONS=837} [2024-06-28 01:49:17,384 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 340 predicate places. [2024-06-28 01:49:17,384 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 837 transitions, 15396 flow [2024-06-28 01:49:17,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:17,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:17,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:17,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 01:49:17,385 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:17,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:17,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2097812834, now seen corresponding path program 5 times [2024-06-28 01:49:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880980365] [2024-06-28 01:49:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:18,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 01:49:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:18,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880980365] [2024-06-28 01:49:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880980365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:18,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:18,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637201148] [2024-06-28 01:49:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:18,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:18,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:18,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:18,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:18,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 837 transitions, 15396 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:18,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:18,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:18,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:20,541 INFO L124 PetriNetUnfolderBase]: 4081/7708 cut-off events. [2024-06-28 01:49:20,541 INFO L125 PetriNetUnfolderBase]: For 235980/236102 co-relation queries the response was YES. [2024-06-28 01:49:20,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61772 conditions, 7708 events. 4081/7708 cut-off events. For 235980/236102 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 62801 event pairs, 571 based on Foata normal form. 105/7765 useless extension candidates. Maximal degree in co-relation 61596. Up to 1926 conditions per place. [2024-06-28 01:49:20,683 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 566 selfloop transitions, 325 changer transitions 0/899 dead transitions. [2024-06-28 01:49:20,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 899 transitions, 18266 flow [2024-06-28 01:49:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-28 01:49:20,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2024-06-28 01:49:20,684 INFO L175 Difference]: Start difference. First operand has 381 places, 837 transitions, 15396 flow. Second operand 10 states and 205 transitions. [2024-06-28 01:49:20,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 899 transitions, 18266 flow [2024-06-28 01:49:22,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 899 transitions, 18085 flow, removed 44 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:22,168 INFO L231 Difference]: Finished difference. Result has 384 places, 839 transitions, 15927 flow [2024-06-28 01:49:22,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15215, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15927, PETRI_PLACES=384, PETRI_TRANSITIONS=839} [2024-06-28 01:49:22,169 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 343 predicate places. [2024-06-28 01:49:22,169 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 839 transitions, 15927 flow [2024-06-28 01:49:22,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:22,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:22,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:22,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 01:49:22,170 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:22,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1757993232, now seen corresponding path program 7 times [2024-06-28 01:49:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684293798] [2024-06-28 01:49:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:22,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 01:49:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684293798] [2024-06-28 01:49:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684293798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:22,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920605420] [2024-06-28 01:49:22,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:23,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:23,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 839 transitions, 15927 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:23,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:23,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:23,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:25,483 INFO L124 PetriNetUnfolderBase]: 4317/8443 cut-off events. [2024-06-28 01:49:25,483 INFO L125 PetriNetUnfolderBase]: For 254125/254193 co-relation queries the response was YES. [2024-06-28 01:49:25,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66516 conditions, 8443 events. 4317/8443 cut-off events. For 254125/254193 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 72239 event pairs, 1174 based on Foata normal form. 32/8400 useless extension candidates. Maximal degree in co-relation 66338. Up to 6426 conditions per place. [2024-06-28 01:49:25,606 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 821 selfloop transitions, 75 changer transitions 0/904 dead transitions. [2024-06-28 01:49:25,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 904 transitions, 18559 flow [2024-06-28 01:49:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:49:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:49:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-28 01:49:25,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2024-06-28 01:49:25,608 INFO L175 Difference]: Start difference. First operand has 384 places, 839 transitions, 15927 flow. Second operand 11 states and 191 transitions. [2024-06-28 01:49:25,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 904 transitions, 18559 flow [2024-06-28 01:49:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 904 transitions, 18157 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 01:49:26,759 INFO L231 Difference]: Finished difference. Result has 391 places, 855 transitions, 16013 flow [2024-06-28 01:49:26,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15525, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16013, PETRI_PLACES=391, PETRI_TRANSITIONS=855} [2024-06-28 01:49:26,760 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 350 predicate places. [2024-06-28 01:49:26,760 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 855 transitions, 16013 flow [2024-06-28 01:49:26,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:26,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:26,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 01:49:26,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 01:49:26,761 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:26,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 503871592, now seen corresponding path program 8 times [2024-06-28 01:49:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021180844] [2024-06-28 01:49:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:27,570 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 01:49:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021180844] [2024-06-28 01:49:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021180844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:27,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498018763] [2024-06-28 01:49:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:27,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:27,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 855 transitions, 16013 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:27,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:27,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:27,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:30,198 INFO L124 PetriNetUnfolderBase]: 4314/8483 cut-off events. [2024-06-28 01:49:30,198 INFO L125 PetriNetUnfolderBase]: For 252070/252140 co-relation queries the response was YES. [2024-06-28 01:49:30,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65940 conditions, 8483 events. 4314/8483 cut-off events. For 252070/252140 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 72951 event pairs, 1252 based on Foata normal form. 34/8448 useless extension candidates. Maximal degree in co-relation 65760. Up to 6594 conditions per place. [2024-06-28 01:49:30,338 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 823 selfloop transitions, 65 changer transitions 0/896 dead transitions. [2024-06-28 01:49:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 896 transitions, 18148 flow [2024-06-28 01:49:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-28 01:49:30,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-28 01:49:30,340 INFO L175 Difference]: Start difference. First operand has 391 places, 855 transitions, 16013 flow. Second operand 10 states and 172 transitions. [2024-06-28 01:49:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 896 transitions, 18148 flow [2024-06-28 01:49:31,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 896 transitions, 18029 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:31,788 INFO L231 Difference]: Finished difference. Result has 395 places, 855 transitions, 16037 flow [2024-06-28 01:49:31,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15894, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16037, PETRI_PLACES=395, PETRI_TRANSITIONS=855} [2024-06-28 01:49:31,789 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 354 predicate places. [2024-06-28 01:49:31,789 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 855 transitions, 16037 flow [2024-06-28 01:49:31,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:31,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:31,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 01:49:31,790 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:31,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash 508455562, now seen corresponding path program 9 times [2024-06-28 01:49:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841071939] [2024-06-28 01:49:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:32,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:32,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841071939] [2024-06-28 01:49:32,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841071939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:32,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662499103] [2024-06-28 01:49:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:32,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:32,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 855 transitions, 16037 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:32,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:32,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:32,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:35,295 INFO L124 PetriNetUnfolderBase]: 4348/8616 cut-off events. [2024-06-28 01:49:35,295 INFO L125 PetriNetUnfolderBase]: For 256361/256414 co-relation queries the response was YES. [2024-06-28 01:49:35,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66584 conditions, 8616 events. 4348/8616 cut-off events. For 256361/256414 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 74837 event pairs, 1164 based on Foata normal form. 25/8581 useless extension candidates. Maximal degree in co-relation 66402. Up to 6454 conditions per place. [2024-06-28 01:49:35,413 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 772 selfloop transitions, 123 changer transitions 0/903 dead transitions. [2024-06-28 01:49:35,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 903 transitions, 18337 flow [2024-06-28 01:49:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-28 01:49:35,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-28 01:49:35,415 INFO L175 Difference]: Start difference. First operand has 395 places, 855 transitions, 16037 flow. Second operand 10 states and 178 transitions. [2024-06-28 01:49:35,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 903 transitions, 18337 flow [2024-06-28 01:49:37,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 903 transitions, 18199 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:49:37,037 INFO L231 Difference]: Finished difference. Result has 396 places, 857 transitions, 16195 flow [2024-06-28 01:49:37,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15899, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16195, PETRI_PLACES=396, PETRI_TRANSITIONS=857} [2024-06-28 01:49:37,037 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 355 predicate places. [2024-06-28 01:49:37,037 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 857 transitions, 16195 flow [2024-06-28 01:49:37,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:37,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:37,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 01:49:37,038 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:37,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1181017590, now seen corresponding path program 10 times [2024-06-28 01:49:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141912724] [2024-06-28 01:49:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:37,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 01:49:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141912724] [2024-06-28 01:49:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141912724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328863884] [2024-06-28 01:49:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:37,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:37,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:37,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 857 transitions, 16195 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:37,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:37,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:40,778 INFO L124 PetriNetUnfolderBase]: 4368/8585 cut-off events. [2024-06-28 01:49:40,778 INFO L125 PetriNetUnfolderBase]: For 263220/263342 co-relation queries the response was YES. [2024-06-28 01:49:40,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67104 conditions, 8585 events. 4368/8585 cut-off events. For 263220/263342 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 74081 event pairs, 1273 based on Foata normal form. 47/8561 useless extension candidates. Maximal degree in co-relation 66921. Up to 6791 conditions per place. [2024-06-28 01:49:41,007 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 824 selfloop transitions, 59 changer transitions 0/891 dead transitions. [2024-06-28 01:49:41,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 891 transitions, 18304 flow [2024-06-28 01:49:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 01:49:41,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-28 01:49:41,008 INFO L175 Difference]: Start difference. First operand has 396 places, 857 transitions, 16195 flow. Second operand 10 states and 171 transitions. [2024-06-28 01:49:41,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 891 transitions, 18304 flow [2024-06-28 01:49:42,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 891 transitions, 18060 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:42,461 INFO L231 Difference]: Finished difference. Result has 399 places, 858 transitions, 16107 flow [2024-06-28 01:49:42,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15951, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16107, PETRI_PLACES=399, PETRI_TRANSITIONS=858} [2024-06-28 01:49:42,461 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2024-06-28 01:49:42,462 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 858 transitions, 16107 flow [2024-06-28 01:49:42,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:42,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:42,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:42,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 01:49:42,462 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:42,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1407043296, now seen corresponding path program 1 times [2024-06-28 01:49:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865782679] [2024-06-28 01:49:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865782679] [2024-06-28 01:49:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865782679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:43,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:43,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:49:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048608009] [2024-06-28 01:49:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:43,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:49:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:49:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:49:43,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:43,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 858 transitions, 16107 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:43,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:43,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:43,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:46,334 INFO L124 PetriNetUnfolderBase]: 4388/8650 cut-off events. [2024-06-28 01:49:46,334 INFO L125 PetriNetUnfolderBase]: For 266583/266690 co-relation queries the response was YES. [2024-06-28 01:49:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67139 conditions, 8650 events. 4388/8650 cut-off events. For 266583/266690 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 74888 event pairs, 1215 based on Foata normal form. 40/8619 useless extension candidates. Maximal degree in co-relation 66955. Up to 6696 conditions per place. [2024-06-28 01:49:46,611 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 815 selfloop transitions, 74 changer transitions 0/897 dead transitions. [2024-06-28 01:49:46,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 897 transitions, 18255 flow [2024-06-28 01:49:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:49:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:49:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-28 01:49:46,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-06-28 01:49:46,612 INFO L175 Difference]: Start difference. First operand has 399 places, 858 transitions, 16107 flow. Second operand 10 states and 179 transitions. [2024-06-28 01:49:46,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 897 transitions, 18255 flow [2024-06-28 01:49:48,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 897 transitions, 17978 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-28 01:49:48,044 INFO L231 Difference]: Finished difference. Result has 400 places, 859 transitions, 16002 flow [2024-06-28 01:49:48,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16002, PETRI_PLACES=400, PETRI_TRANSITIONS=859} [2024-06-28 01:49:48,045 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 359 predicate places. [2024-06-28 01:49:48,045 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 859 transitions, 16002 flow [2024-06-28 01:49:48,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:48,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:48,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:48,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 01:49:48,046 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:48,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -919458904, now seen corresponding path program 11 times [2024-06-28 01:49:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982475683] [2024-06-28 01:49:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:49,345 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 01:49:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:49,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982475683] [2024-06-28 01:49:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982475683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:49,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:49,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:49:49,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073490157] [2024-06-28 01:49:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:49,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:49:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:49:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:49:49,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:49,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 859 transitions, 16002 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:49,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:49,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:49,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:52,409 INFO L124 PetriNetUnfolderBase]: 4423/8683 cut-off events. [2024-06-28 01:49:52,410 INFO L125 PetriNetUnfolderBase]: For 266875/266954 co-relation queries the response was YES. [2024-06-28 01:49:52,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67601 conditions, 8683 events. 4423/8683 cut-off events. For 266875/266954 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 74724 event pairs, 881 based on Foata normal form. 62/8645 useless extension candidates. Maximal degree in co-relation 67416. Up to 5838 conditions per place. [2024-06-28 01:49:52,561 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 746 selfloop transitions, 160 changer transitions 0/914 dead transitions. [2024-06-28 01:49:52,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 914 transitions, 18571 flow [2024-06-28 01:49:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:49:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:49:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-28 01:49:52,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157248157248156 [2024-06-28 01:49:52,562 INFO L175 Difference]: Start difference. First operand has 400 places, 859 transitions, 16002 flow. Second operand 11 states and 196 transitions. [2024-06-28 01:49:52,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 914 transitions, 18571 flow [2024-06-28 01:49:54,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 914 transitions, 18415 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 01:49:54,097 INFO L231 Difference]: Finished difference. Result has 403 places, 863 transitions, 16306 flow [2024-06-28 01:49:54,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15846, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16306, PETRI_PLACES=403, PETRI_TRANSITIONS=863} [2024-06-28 01:49:54,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 362 predicate places. [2024-06-28 01:49:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 863 transitions, 16306 flow [2024-06-28 01:49:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:54,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:54,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 01:49:54,099 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:54,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 763076926, now seen corresponding path program 1 times [2024-06-28 01:49:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015727588] [2024-06-28 01:49:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:55,287 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 01:49:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015727588] [2024-06-28 01:49:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015727588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:55,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:55,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:49:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012856394] [2024-06-28 01:49:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:49:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:49:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:49:55,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:49:55,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 863 transitions, 16306 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:55,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:55,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:49:55,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:58,313 INFO L124 PetriNetUnfolderBase]: 4427/8793 cut-off events. [2024-06-28 01:49:58,313 INFO L125 PetriNetUnfolderBase]: For 268315/268358 co-relation queries the response was YES. [2024-06-28 01:49:58,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68697 conditions, 8793 events. 4427/8793 cut-off events. For 268315/268358 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 76424 event pairs, 1076 based on Foata normal form. 28/8776 useless extension candidates. Maximal degree in co-relation 68511. Up to 6361 conditions per place. [2024-06-28 01:49:58,462 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 752 selfloop transitions, 142 changer transitions 0/902 dead transitions. [2024-06-28 01:49:58,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 902 transitions, 18508 flow [2024-06-28 01:49:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:49:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:49:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 01:49:58,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-28 01:49:58,464 INFO L175 Difference]: Start difference. First operand has 403 places, 863 transitions, 16306 flow. Second operand 9 states and 161 transitions. [2024-06-28 01:49:58,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 902 transitions, 18508 flow [2024-06-28 01:50:00,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 902 transitions, 18302 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:00,117 INFO L231 Difference]: Finished difference. Result has 404 places, 865 transitions, 16494 flow [2024-06-28 01:50:00,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16100, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16494, PETRI_PLACES=404, PETRI_TRANSITIONS=865} [2024-06-28 01:50:00,118 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 363 predicate places. [2024-06-28 01:50:00,118 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 865 transitions, 16494 flow [2024-06-28 01:50:00,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:00,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:00,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:00,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 01:50:00,119 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:00,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash 763076802, now seen corresponding path program 12 times [2024-06-28 01:50:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124284151] [2024-06-28 01:50:00,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:00,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:01,391 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 01:50:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124284151] [2024-06-28 01:50:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124284151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022242379] [2024-06-28 01:50:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:01,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:01,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:01,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:01,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 865 transitions, 16494 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:01,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:01,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:01,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:04,344 INFO L124 PetriNetUnfolderBase]: 4752/9459 cut-off events. [2024-06-28 01:50:04,344 INFO L125 PetriNetUnfolderBase]: For 279007/279049 co-relation queries the response was YES. [2024-06-28 01:50:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74608 conditions, 9459 events. 4752/9459 cut-off events. For 279007/279049 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 83763 event pairs, 1116 based on Foata normal form. 28/9407 useless extension candidates. Maximal degree in co-relation 74423. Up to 6838 conditions per place. [2024-06-28 01:50:04,676 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 783 selfloop transitions, 165 changer transitions 0/956 dead transitions. [2024-06-28 01:50:04,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 956 transitions, 19930 flow [2024-06-28 01:50:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:50:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:50:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-28 01:50:04,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47665847665847666 [2024-06-28 01:50:04,678 INFO L175 Difference]: Start difference. First operand has 404 places, 865 transitions, 16494 flow. Second operand 11 states and 194 transitions. [2024-06-28 01:50:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 956 transitions, 19930 flow [2024-06-28 01:50:05,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 956 transitions, 19622 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:05,922 INFO L231 Difference]: Finished difference. Result has 407 places, 905 transitions, 17585 flow [2024-06-28 01:50:05,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16225, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17585, PETRI_PLACES=407, PETRI_TRANSITIONS=905} [2024-06-28 01:50:05,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 366 predicate places. [2024-06-28 01:50:05,923 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 905 transitions, 17585 flow [2024-06-28 01:50:05,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:05,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:05,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 01:50:05,923 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:05,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 765878272, now seen corresponding path program 6 times [2024-06-28 01:50:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209050891] [2024-06-28 01:50:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:07,018 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 01:50:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:07,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209050891] [2024-06-28 01:50:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209050891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:07,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:07,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637947137] [2024-06-28 01:50:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:07,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:07,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:07,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 905 transitions, 17585 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:07,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:07,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:07,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:09,988 INFO L124 PetriNetUnfolderBase]: 4739/9422 cut-off events. [2024-06-28 01:50:09,989 INFO L125 PetriNetUnfolderBase]: For 274473/274690 co-relation queries the response was YES. [2024-06-28 01:50:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74868 conditions, 9422 events. 4739/9422 cut-off events. For 274473/274690 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 83406 event pairs, 1248 based on Foata normal form. 87/9436 useless extension candidates. Maximal degree in co-relation 74683. Up to 7074 conditions per place. [2024-06-28 01:50:10,135 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 824 selfloop transitions, 118 changer transitions 0/950 dead transitions. [2024-06-28 01:50:10,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 950 transitions, 19955 flow [2024-06-28 01:50:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-28 01:50:10,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-28 01:50:10,136 INFO L175 Difference]: Start difference. First operand has 407 places, 905 transitions, 17585 flow. Second operand 10 states and 175 transitions. [2024-06-28 01:50:10,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 950 transitions, 19955 flow [2024-06-28 01:50:11,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 950 transitions, 19629 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:11,487 INFO L231 Difference]: Finished difference. Result has 409 places, 907 transitions, 17575 flow [2024-06-28 01:50:11,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17259, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17575, PETRI_PLACES=409, PETRI_TRANSITIONS=907} [2024-06-28 01:50:11,488 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 368 predicate places. [2024-06-28 01:50:11,488 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 907 transitions, 17575 flow [2024-06-28 01:50:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:11,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:11,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:11,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 01:50:11,489 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:11,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash 765873312, now seen corresponding path program 13 times [2024-06-28 01:50:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974489479] [2024-06-28 01:50:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:12,447 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 01:50:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974489479] [2024-06-28 01:50:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974489479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:12,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724945719] [2024-06-28 01:50:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:12,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:12,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:12,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:12,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 907 transitions, 17575 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:12,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:12,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:15,294 INFO L124 PetriNetUnfolderBase]: 4750/9363 cut-off events. [2024-06-28 01:50:15,295 INFO L125 PetriNetUnfolderBase]: For 267378/267444 co-relation queries the response was YES. [2024-06-28 01:50:15,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74520 conditions, 9363 events. 4750/9363 cut-off events. For 267378/267444 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 82031 event pairs, 1085 based on Foata normal form. 52/9303 useless extension candidates. Maximal degree in co-relation 74334. Up to 6618 conditions per place. [2024-06-28 01:50:15,451 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 773 selfloop transitions, 162 changer transitions 0/943 dead transitions. [2024-06-28 01:50:15,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 943 transitions, 19778 flow [2024-06-28 01:50:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:50:15,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804804804804805 [2024-06-28 01:50:15,452 INFO L175 Difference]: Start difference. First operand has 409 places, 907 transitions, 17575 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:50:15,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 943 transitions, 19778 flow [2024-06-28 01:50:16,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 943 transitions, 19513 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-28 01:50:16,802 INFO L231 Difference]: Finished difference. Result has 409 places, 907 transitions, 17692 flow [2024-06-28 01:50:16,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17310, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17692, PETRI_PLACES=409, PETRI_TRANSITIONS=907} [2024-06-28 01:50:16,802 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 368 predicate places. [2024-06-28 01:50:16,802 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 907 transitions, 17692 flow [2024-06-28 01:50:16,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:16,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:16,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:16,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 01:50:16,803 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:16,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash 881342422, now seen corresponding path program 7 times [2024-06-28 01:50:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080184651] [2024-06-28 01:50:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:17,743 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 01:50:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080184651] [2024-06-28 01:50:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080184651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725450630] [2024-06-28 01:50:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:17,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:17,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:17,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 907 transitions, 17692 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:17,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:17,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:17,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:20,786 INFO L124 PetriNetUnfolderBase]: 4924/9510 cut-off events. [2024-06-28 01:50:20,786 INFO L125 PetriNetUnfolderBase]: For 289987/290168 co-relation queries the response was YES. [2024-06-28 01:50:20,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77309 conditions, 9510 events. 4924/9510 cut-off events. For 289987/290168 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 82191 event pairs, 852 based on Foata normal form. 95/9515 useless extension candidates. Maximal degree in co-relation 77123. Up to 4827 conditions per place. [2024-06-28 01:50:20,940 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 693 selfloop transitions, 303 changer transitions 0/1004 dead transitions. [2024-06-28 01:50:20,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1004 transitions, 21568 flow [2024-06-28 01:50:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:50:20,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:50:20,941 INFO L175 Difference]: Start difference. First operand has 409 places, 907 transitions, 17692 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:50:20,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1004 transitions, 21568 flow [2024-06-28 01:50:22,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1004 transitions, 21160 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-28 01:50:22,491 INFO L231 Difference]: Finished difference. Result has 409 places, 933 transitions, 18421 flow [2024-06-28 01:50:22,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17302, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18421, PETRI_PLACES=409, PETRI_TRANSITIONS=933} [2024-06-28 01:50:22,492 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 368 predicate places. [2024-06-28 01:50:22,492 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 933 transitions, 18421 flow [2024-06-28 01:50:22,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:22,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:22,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 01:50:22,492 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:22,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 881342236, now seen corresponding path program 2 times [2024-06-28 01:50:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324838287] [2024-06-28 01:50:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:24,312 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 01:50:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324838287] [2024-06-28 01:50:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324838287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590066753] [2024-06-28 01:50:24,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:24,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:24,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:24,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 933 transitions, 18421 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:24,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:24,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:27,462 INFO L124 PetriNetUnfolderBase]: 4945/9507 cut-off events. [2024-06-28 01:50:27,463 INFO L125 PetriNetUnfolderBase]: For 282293/282474 co-relation queries the response was YES. [2024-06-28 01:50:27,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77992 conditions, 9507 events. 4945/9507 cut-off events. For 282293/282474 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 81929 event pairs, 843 based on Foata normal form. 94/9510 useless extension candidates. Maximal degree in co-relation 77807. Up to 5877 conditions per place. [2024-06-28 01:50:27,622 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 654 selfloop transitions, 345 changer transitions 0/1007 dead transitions. [2024-06-28 01:50:27,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1007 transitions, 21527 flow [2024-06-28 01:50:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 01:50:27,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:50:27,624 INFO L175 Difference]: Start difference. First operand has 409 places, 933 transitions, 18421 flow. Second operand 10 states and 185 transitions. [2024-06-28 01:50:27,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1007 transitions, 21527 flow [2024-06-28 01:50:29,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1007 transitions, 21301 flow, removed 79 selfloop flow, removed 3 redundant places. [2024-06-28 01:50:29,256 INFO L231 Difference]: Finished difference. Result has 416 places, 939 transitions, 19041 flow [2024-06-28 01:50:29,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18195, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19041, PETRI_PLACES=416, PETRI_TRANSITIONS=939} [2024-06-28 01:50:29,257 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 375 predicate places. [2024-06-28 01:50:29,257 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 939 transitions, 19041 flow [2024-06-28 01:50:29,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:29,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:29,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:29,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 01:50:29,257 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:29,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash 881348932, now seen corresponding path program 8 times [2024-06-28 01:50:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57293977] [2024-06-28 01:50:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:30,290 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 01:50:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:30,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57293977] [2024-06-28 01:50:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57293977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:30,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:30,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321256874] [2024-06-28 01:50:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:30,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-28 01:50:30,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 939 transitions, 19041 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:30,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:30,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-28 01:50:30,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand