./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:55:48,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:55:48,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:55:48,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:55:48,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:55:48,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:55:48,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:55:48,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:55:48,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:55:48,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:55:48,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:55:48,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:55:48,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:55:48,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:55:48,675 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:55:48,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:55:48,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:55:48,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:55:48,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:55:48,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:55:48,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:55:48,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:55:48,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:55:48,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:55:48,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:55:48,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:55:48,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:55:48,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:55:48,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:55:48,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:55:48,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:55:48,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:55:48,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:55:48,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:55:48,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:55:48,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:55:48,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:55:48,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:55:48,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:55:48,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:55:48,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:55:48,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:55:48,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:55:48,683 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:55:48,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:55:48,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:55:48,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:55:48,941 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:55:48,941 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:55:48,942 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 01:55:49,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:55:49,113 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:55:49,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:55:50,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:55:50,233 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:55:50,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:55:50,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08fbf2bc/63a673a2c94a4efab2758341ba0b2cdb/FLAG76213d48e [2024-06-28 01:55:50,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08fbf2bc/63a673a2c94a4efab2758341ba0b2cdb [2024-06-28 01:55:50,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:55:50,255 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:55:50,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:55:50,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:55:50,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:55:50,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:55:49" (1/2) ... [2024-06-28 01:55:50,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212c55ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:55:50, skipping insertion in model container [2024-06-28 01:55:50,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:55:49" (1/2) ... [2024-06-28 01:55:50,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fcf6df9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:55:50, skipping insertion in model container [2024-06-28 01:55:50,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:55:50" (2/2) ... [2024-06-28 01:55:50,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212c55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50, skipping insertion in model container [2024-06-28 01:55:50,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:55:50" (2/2) ... [2024-06-28 01:55:50,263 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:55:50,331 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:55:50,332 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] (((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2)) [2024-06-28 01:55:50,332 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2)) [2024-06-28 01:55:50,333 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2)) [2024-06-28 01:55:50,333 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:55:50,333 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-28 01:55:50,410 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:55:50,588 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2024-06-28 01:55:50,769 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:55:50,776 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:55:50,814 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:55:50,909 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:55:50,945 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:55:50,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50 WrapperNode [2024-06-28 01:55:50,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:55:50,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:55:50,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:55:50,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:55:50,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:50,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:50,999 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2024-06-28 01:55:50,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:55:51,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:55:51,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:55:51,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:55:51,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,024 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:55:51,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:55:51,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:55:51,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:55:51,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:55:51,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (1/1) ... [2024-06-28 01:55:51,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:55:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:55:51,094 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:55:51,130 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:55:51,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:55:51,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:55:51,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:55:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:55:51,157 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:55:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:55:51,157 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:55:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:55:51,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:55:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:55:51,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:55:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:55:51,160 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:55:51,284 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:55:51,286 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:55:51,591 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:55:51,591 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:55:51,715 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:55:51,715 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:55:51,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:55:51 BoogieIcfgContainer [2024-06-28 01:55:51,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:55:51,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:55:51,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:55:51,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:55:51,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:55:49" (1/4) ... [2024-06-28 01:55:51,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f21d63 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:55:51, skipping insertion in model container [2024-06-28 01:55:51,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:55:50" (2/4) ... [2024-06-28 01:55:51,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f21d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:55:51, skipping insertion in model container [2024-06-28 01:55:51,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:55:50" (3/4) ... [2024-06-28 01:55:51,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f21d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:55:51, skipping insertion in model container [2024-06-28 01:55:51,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:55:51" (4/4) ... [2024-06-28 01:55:51,725 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:55:51,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:55:51,738 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:55:51,738 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:55:51,777 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:55:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-28 01:55:51,838 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-28 01:55:51,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:55:51,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-28 01:55:51,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-28 01:55:51,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-28 01:55:51,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:55:51,867 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;@ea3c04f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:55:51,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:55:51,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:55:51,873 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:55:51,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:55:51,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:51,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:55:51,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:51,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 353829654, now seen corresponding path program 1 times [2024-06-28 01:55:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087397023] [2024-06-28 01:55:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:52,762 INFO L134 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:55:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087397023] [2024-06-28 01:55:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087397023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:55:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093916332] [2024-06-28 01:55:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:52,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:55:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:55:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:55:52,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-06-28 01:55:52,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:55:52,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:52,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-06-28 01:55:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:53,351 INFO L124 PetriNetUnfolderBase]: 3513/5090 cut-off events. [2024-06-28 01:55:53,352 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-06-28 01:55:53,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10260 conditions, 5090 events. 3513/5090 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 27294 event pairs, 1901 based on Foata normal form. 176/4997 useless extension candidates. Maximal degree in co-relation 10248. Up to 5066 conditions per place. [2024-06-28 01:55:53,376 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 42 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-06-28 01:55:53,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 225 flow [2024-06-28 01:55:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:55:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:55:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-28 01:55:53,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-06-28 01:55:53,386 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 94 transitions. [2024-06-28 01:55:53,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 225 flow [2024-06-28 01:55:53,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:55:53,390 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 127 flow [2024-06-28 01:55:53,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-28 01:55:53,394 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-28 01:55:53,394 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 127 flow [2024-06-28 01:55:53,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:55:53,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:53,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:55:53,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:55:53,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:53,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash 353831028, now seen corresponding path program 1 times [2024-06-28 01:55:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093453882] [2024-06-28 01:55:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:53,438 INFO L134 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:55:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093453882] [2024-06-28 01:55:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093453882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:55:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947387315] [2024-06-28 01:55:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:53,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:55:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:55:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:55:53,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2024-06-28 01:55:53,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:53,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:53,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2024-06-28 01:55:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:53,619 INFO L124 PetriNetUnfolderBase]: 891/1707 cut-off events. [2024-06-28 01:55:53,620 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-06-28 01:55:53,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1707 events. 891/1707 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11472 event pairs, 577 based on Foata normal form. 0/1562 useless extension candidates. Maximal degree in co-relation 3300. Up to 1152 conditions per place. [2024-06-28 01:55:53,629 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 35 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-06-28 01:55:53,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 230 flow [2024-06-28 01:55:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:55:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:55:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-28 01:55:53,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7753623188405797 [2024-06-28 01:55:53,633 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 127 flow. Second operand 3 states and 107 transitions. [2024-06-28 01:55:53,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 230 flow [2024-06-28 01:55:53,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:55:53,635 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 120 flow [2024-06-28 01:55:53,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-28 01:55:53,636 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-28 01:55:53,636 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 120 flow [2024-06-28 01:55:53,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:53,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:53,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:53,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:55:53,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:53,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 727930580, now seen corresponding path program 1 times [2024-06-28 01:55:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:53,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252078356] [2024-06-28 01:55:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:53,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:54,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:55:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252078356] [2024-06-28 01:55:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252078356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:55:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289031873] [2024-06-28 01:55:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:54,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:55:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:55:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:55:54,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-06-28 01:55:54,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:54,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:54,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-06-28 01:55:54,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:54,589 INFO L124 PetriNetUnfolderBase]: 2986/4790 cut-off events. [2024-06-28 01:55:54,589 INFO L125 PetriNetUnfolderBase]: For 1136/1143 co-relation queries the response was YES. [2024-06-28 01:55:54,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 4790 events. 2986/4790 cut-off events. For 1136/1143 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 28597 event pairs, 1953 based on Foata normal form. 7/4642 useless extension candidates. Maximal degree in co-relation 10314. Up to 4299 conditions per place. [2024-06-28 01:55:54,608 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 50 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2024-06-28 01:55:54,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 314 flow [2024-06-28 01:55:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:55:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:55:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-06-28 01:55:54,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-06-28 01:55:54,613 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 120 flow. Second operand 4 states and 116 transitions. [2024-06-28 01:55:54,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 314 flow [2024-06-28 01:55:54,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:55:54,617 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 181 flow [2024-06-28 01:55:54,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-28 01:55:54,618 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-06-28 01:55:54,618 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 181 flow [2024-06-28 01:55:54,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:54,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:54,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:54,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:55:54,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:54,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1091013137, now seen corresponding path program 1 times [2024-06-28 01:55:54,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:54,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258057531] [2024-06-28 01:55:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:55,180 INFO L134 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:55:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258057531] [2024-06-28 01:55:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258057531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:55,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:55:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886077303] [2024-06-28 01:55:55,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:55,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:55:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:55:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:55:55,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-28 01:55:55,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 181 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:55:55,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:55,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-28 01:55:55,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:55,655 INFO L124 PetriNetUnfolderBase]: 3185/5163 cut-off events. [2024-06-28 01:55:55,655 INFO L125 PetriNetUnfolderBase]: For 2192/2204 co-relation queries the response was YES. [2024-06-28 01:55:55,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12007 conditions, 5163 events. 3185/5163 cut-off events. For 2192/2204 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31236 event pairs, 1708 based on Foata normal form. 12/4990 useless extension candidates. Maximal degree in co-relation 11992. Up to 4558 conditions per place. [2024-06-28 01:55:55,723 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 11 changer transitions 0/90 dead transitions. [2024-06-28 01:55:55,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 463 flow [2024-06-28 01:55:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:55:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:55:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-28 01:55:55,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-28 01:55:55,724 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 181 flow. Second operand 5 states and 138 transitions. [2024-06-28 01:55:55,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 463 flow [2024-06-28 01:55:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 446 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 01:55:55,727 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 267 flow [2024-06-28 01:55:55,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2024-06-28 01:55:55,728 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-06-28 01:55:55,728 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 267 flow [2024-06-28 01:55:55,728 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:55:55,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:55,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:55:55,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:55,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -538329453, now seen corresponding path program 1 times [2024-06-28 01:55:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625238657] [2024-06-28 01:55:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:56,498 INFO L134 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:55:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625238657] [2024-06-28 01:55:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625238657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:55:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646527543] [2024-06-28 01:55:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:56,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:55:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:55:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:55:56,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-28 01:55:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-28 01:55:56,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:57,142 INFO L124 PetriNetUnfolderBase]: 3187/5165 cut-off events. [2024-06-28 01:55:57,142 INFO L125 PetriNetUnfolderBase]: For 3795/3819 co-relation queries the response was YES. [2024-06-28 01:55:57,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12978 conditions, 5165 events. 3187/5165 cut-off events. For 3795/3819 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31016 event pairs, 1750 based on Foata normal form. 18/4998 useless extension candidates. Maximal degree in co-relation 12959. Up to 4538 conditions per place. [2024-06-28 01:55:57,162 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 79 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-06-28 01:55:57,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 573 flow [2024-06-28 01:55:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-28 01:55:57,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-06-28 01:55:57,164 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 267 flow. Second operand 6 states and 165 transitions. [2024-06-28 01:55:57,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 573 flow [2024-06-28 01:55:57,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 569 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 01:55:57,169 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 328 flow [2024-06-28 01:55:57,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2024-06-28 01:55:57,170 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-06-28 01:55:57,170 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 328 flow [2024-06-28 01:55:57,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:57,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:57,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:57,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:55:57,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:57,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash 491657840, now seen corresponding path program 1 times [2024-06-28 01:55:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404546309] [2024-06-28 01:55:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404546309] [2024-06-28 01:55:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404546309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:55:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60626616] [2024-06-28 01:55:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:57,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:55:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:55:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:55:57,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-28 01:55:57,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:57,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:57,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-28 01:55:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:58,650 INFO L124 PetriNetUnfolderBase]: 3311/5348 cut-off events. [2024-06-28 01:55:58,660 INFO L125 PetriNetUnfolderBase]: For 5861/5885 co-relation queries the response was YES. [2024-06-28 01:55:58,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14622 conditions, 5348 events. 3311/5348 cut-off events. For 5861/5885 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 32274 event pairs, 1140 based on Foata normal form. 33/5194 useless extension candidates. Maximal degree in co-relation 14600. Up to 4478 conditions per place. [2024-06-28 01:55:58,680 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 108 selfloop transitions, 32 changer transitions 0/150 dead transitions. [2024-06-28 01:55:58,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 957 flow [2024-06-28 01:55:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2024-06-28 01:55:58,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6242236024844721 [2024-06-28 01:55:58,681 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 328 flow. Second operand 7 states and 201 transitions. [2024-06-28 01:55:58,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 957 flow [2024-06-28 01:55:58,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 150 transitions, 902 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:58,688 INFO L231 Difference]: Finished difference. Result has 72 places, 92 transitions, 572 flow [2024-06-28 01:55:58,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=72, PETRI_TRANSITIONS=92} [2024-06-28 01:55:58,690 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2024-06-28 01:55:58,690 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 92 transitions, 572 flow [2024-06-28 01:55:58,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:58,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:58,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:58,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:55:58,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:55:58,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1597463221, now seen corresponding path program 1 times [2024-06-28 01:55:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:58,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124445340] [2024-06-28 01:55:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:59,262 INFO L134 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:55:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124445340] [2024-06-28 01:55:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124445340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:59,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:55:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823894530] [2024-06-28 01:55:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:59,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:55:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:55:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:55:59,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:55:59,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 92 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:59,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:59,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:55:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:00,132 INFO L124 PetriNetUnfolderBase]: 4515/7129 cut-off events. [2024-06-28 01:56:00,132 INFO L125 PetriNetUnfolderBase]: For 14529/14529 co-relation queries the response was YES. [2024-06-28 01:56:00,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22502 conditions, 7129 events. 4515/7129 cut-off events. For 14529/14529 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 42893 event pairs, 1982 based on Foata normal form. 4/6913 useless extension candidates. Maximal degree in co-relation 22474. Up to 6404 conditions per place. [2024-06-28 01:56:00,180 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 110 selfloop transitions, 12 changer transitions 0/129 dead transitions. [2024-06-28 01:56:00,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 129 transitions, 987 flow [2024-06-28 01:56:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:56:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:56:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-28 01:56:00,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49130434782608695 [2024-06-28 01:56:00,183 INFO L175 Difference]: Start difference. First operand has 72 places, 92 transitions, 572 flow. Second operand 5 states and 113 transitions. [2024-06-28 01:56:00,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 129 transitions, 987 flow [2024-06-28 01:56:00,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 971 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-28 01:56:00,193 INFO L231 Difference]: Finished difference. Result has 78 places, 102 transitions, 683 flow [2024-06-28 01:56:00,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=78, PETRI_TRANSITIONS=102} [2024-06-28 01:56:00,194 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2024-06-28 01:56:00,194 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 102 transitions, 683 flow [2024-06-28 01:56:00,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:00,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:00,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:00,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:56:00,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:00,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2064928975, now seen corresponding path program 1 times [2024-06-28 01:56:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231273674] [2024-06-28 01:56:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:00,880 INFO L134 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:56:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231273674] [2024-06-28 01:56:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231273674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:00,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835718502] [2024-06-28 01:56:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:00,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:00,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:00,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:00,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 102 transitions, 683 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:00,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:00,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:01,689 INFO L124 PetriNetUnfolderBase]: 4422/6998 cut-off events. [2024-06-28 01:56:01,690 INFO L125 PetriNetUnfolderBase]: For 19723/19901 co-relation queries the response was YES. [2024-06-28 01:56:01,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24208 conditions, 6998 events. 4422/6998 cut-off events. For 19723/19901 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 42556 event pairs, 1654 based on Foata normal form. 70/6824 useless extension candidates. Maximal degree in co-relation 24175. Up to 6172 conditions per place. [2024-06-28 01:56:01,736 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 115 selfloop transitions, 29 changer transitions 0/154 dead transitions. [2024-06-28 01:56:01,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 154 transitions, 1183 flow [2024-06-28 01:56:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-28 01:56:01,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-06-28 01:56:01,738 INFO L175 Difference]: Start difference. First operand has 78 places, 102 transitions, 683 flow. Second operand 7 states and 170 transitions. [2024-06-28 01:56:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 154 transitions, 1183 flow [2024-06-28 01:56:01,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 154 transitions, 1177 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-28 01:56:01,758 INFO L231 Difference]: Finished difference. Result has 84 places, 108 transitions, 802 flow [2024-06-28 01:56:01,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=84, PETRI_TRANSITIONS=108} [2024-06-28 01:56:01,760 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2024-06-28 01:56:01,760 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 108 transitions, 802 flow [2024-06-28 01:56:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:01,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:01,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:01,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:56:01,761 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:01,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash -733009405, now seen corresponding path program 2 times [2024-06-28 01:56:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798709803] [2024-06-28 01:56:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:02,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:56:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798709803] [2024-06-28 01:56:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798709803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678185969] [2024-06-28 01:56:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:02,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:02,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:02,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 108 transitions, 802 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:02,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:02,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:02,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:03,275 INFO L124 PetriNetUnfolderBase]: 4391/6961 cut-off events. [2024-06-28 01:56:03,276 INFO L125 PetriNetUnfolderBase]: For 25059/25292 co-relation queries the response was YES. [2024-06-28 01:56:03,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25374 conditions, 6961 events. 4391/6961 cut-off events. For 25059/25292 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 42328 event pairs, 1661 based on Foata normal form. 90/6806 useless extension candidates. Maximal degree in co-relation 25338. Up to 6188 conditions per place. [2024-06-28 01:56:03,307 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 118 selfloop transitions, 26 changer transitions 0/154 dead transitions. [2024-06-28 01:56:03,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 154 transitions, 1259 flow [2024-06-28 01:56:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-06-28 01:56:03,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2024-06-28 01:56:03,308 INFO L175 Difference]: Start difference. First operand has 84 places, 108 transitions, 802 flow. Second operand 7 states and 164 transitions. [2024-06-28 01:56:03,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 154 transitions, 1259 flow [2024-06-28 01:56:03,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 154 transitions, 1215 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:03,325 INFO L231 Difference]: Finished difference. Result has 88 places, 114 transitions, 878 flow [2024-06-28 01:56:03,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=878, PETRI_PLACES=88, PETRI_TRANSITIONS=114} [2024-06-28 01:56:03,326 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2024-06-28 01:56:03,326 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 114 transitions, 878 flow [2024-06-28 01:56:03,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:03,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:03,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:03,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:56:03,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:03,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2064808819, now seen corresponding path program 1 times [2024-06-28 01:56:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887005065] [2024-06-28 01:56:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:03,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:03,946 INFO L134 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:56:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887005065] [2024-06-28 01:56:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887005065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396909593] [2024-06-28 01:56:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:03,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:04,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:04,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 114 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:04,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:04,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:04,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:04,791 INFO L124 PetriNetUnfolderBase]: 4760/7503 cut-off events. [2024-06-28 01:56:04,791 INFO L125 PetriNetUnfolderBase]: For 24110/24113 co-relation queries the response was YES. [2024-06-28 01:56:04,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26569 conditions, 7503 events. 4760/7503 cut-off events. For 24110/24113 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 45344 event pairs, 1672 based on Foata normal form. 4/7275 useless extension candidates. Maximal degree in co-relation 26531. Up to 6629 conditions per place. [2024-06-28 01:56:04,850 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 149 selfloop transitions, 25 changer transitions 0/181 dead transitions. [2024-06-28 01:56:04,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 181 transitions, 1543 flow [2024-06-28 01:56:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-06-28 01:56:04,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093167701863354 [2024-06-28 01:56:04,853 INFO L175 Difference]: Start difference. First operand has 88 places, 114 transitions, 878 flow. Second operand 7 states and 164 transitions. [2024-06-28 01:56:04,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 181 transitions, 1543 flow [2024-06-28 01:56:04,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 181 transitions, 1460 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-28 01:56:04,879 INFO L231 Difference]: Finished difference. Result has 94 places, 135 transitions, 1060 flow [2024-06-28 01:56:04,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1060, PETRI_PLACES=94, PETRI_TRANSITIONS=135} [2024-06-28 01:56:04,879 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-06-28 01:56:04,879 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 135 transitions, 1060 flow [2024-06-28 01:56:04,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:04,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:04,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:04,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:56:04,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:04,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 502298435, now seen corresponding path program 3 times [2024-06-28 01:56:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:04,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963181937] [2024-06-28 01:56:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:05,449 INFO L134 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:56:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963181937] [2024-06-28 01:56:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963181937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161929303] [2024-06-28 01:56:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:05,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:05,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 135 transitions, 1060 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:05,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:05,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:06,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][78], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, 45#L756true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L836true, 71#true, 149#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 11#L793true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,132 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,132 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,132 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,132 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][79], [111#true, 20#L786true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L836true, 16#L753true, 149#true, 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 11#L793true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,133 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,133 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,133 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,133 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L793-->L796: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][109], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L836true, 16#L753true, 6#L796true, 71#true, 149#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,134 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:56:06,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][78], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, 45#L756true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L852true, 71#true, 149#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 11#L793true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,196 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,196 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,196 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,196 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L793-->L796: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][109], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L852true, 16#L753true, 6#L796true, 71#true, 149#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,197 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,197 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,197 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,197 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:06,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][79], [111#true, 20#L786true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L852true, 16#L753true, 71#true, 149#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 11#L793true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,254 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-06-28 01:56:06,254 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:06,254 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:06,254 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:06,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][78], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, 45#L756true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 149#true, 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 40#L18-1true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 135#true, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L793true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,263 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,263 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,263 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,263 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][79], [111#true, 20#L786true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 16#L753true, 149#true, 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 40#L18-1true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 135#true, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L793true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,264 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,264 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,264 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,264 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L793-->L796: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][109], [111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 86#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 16#L753true, 6#L796true, 149#true, 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 40#L18-1true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 135#true, 13#L783true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-28 01:56:06,264 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,265 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,265 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,265 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 01:56:06,484 INFO L124 PetriNetUnfolderBase]: 4533/7207 cut-off events. [2024-06-28 01:56:06,485 INFO L125 PetriNetUnfolderBase]: For 31383/31864 co-relation queries the response was YES. [2024-06-28 01:56:06,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27968 conditions, 7207 events. 4533/7207 cut-off events. For 31383/31864 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 44410 event pairs, 1522 based on Foata normal form. 77/6931 useless extension candidates. Maximal degree in co-relation 27926. Up to 6313 conditions per place. [2024-06-28 01:56:06,535 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 120 selfloop transitions, 35 changer transitions 0/170 dead transitions. [2024-06-28 01:56:06,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 170 transitions, 1478 flow [2024-06-28 01:56:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:56:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:56:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-28 01:56:06,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-06-28 01:56:06,537 INFO L175 Difference]: Start difference. First operand has 94 places, 135 transitions, 1060 flow. Second operand 6 states and 145 transitions. [2024-06-28 01:56:06,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 170 transitions, 1478 flow [2024-06-28 01:56:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 170 transitions, 1452 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 01:56:06,571 INFO L231 Difference]: Finished difference. Result has 99 places, 135 transitions, 1122 flow [2024-06-28 01:56:06,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1122, PETRI_PLACES=99, PETRI_TRANSITIONS=135} [2024-06-28 01:56:06,572 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2024-06-28 01:56:06,572 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 135 transitions, 1122 flow [2024-06-28 01:56:06,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:06,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:06,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:56:06,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:06,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1931836203, now seen corresponding path program 2 times [2024-06-28 01:56:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094473990] [2024-06-28 01:56:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094473990] [2024-06-28 01:56:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094473990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362615208] [2024-06-28 01:56:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:07,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:07,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 135 transitions, 1122 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:07,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:07,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:07,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:08,126 INFO L124 PetriNetUnfolderBase]: 4804/7564 cut-off events. [2024-06-28 01:56:08,126 INFO L125 PetriNetUnfolderBase]: For 30806/30809 co-relation queries the response was YES. [2024-06-28 01:56:08,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28943 conditions, 7564 events. 4804/7564 cut-off events. For 30806/30809 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 45621 event pairs, 1669 based on Foata normal form. 4/7336 useless extension candidates. Maximal degree in co-relation 28898. Up to 6662 conditions per place. [2024-06-28 01:56:08,174 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 141 selfloop transitions, 27 changer transitions 0/175 dead transitions. [2024-06-28 01:56:08,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 175 transitions, 1641 flow [2024-06-28 01:56:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:56:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:56:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-28 01:56:08,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2024-06-28 01:56:08,176 INFO L175 Difference]: Start difference. First operand has 99 places, 135 transitions, 1122 flow. Second operand 6 states and 142 transitions. [2024-06-28 01:56:08,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 175 transitions, 1641 flow [2024-06-28 01:56:08,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 1558 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:08,202 INFO L231 Difference]: Finished difference. Result has 101 places, 139 transitions, 1148 flow [2024-06-28 01:56:08,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=101, PETRI_TRANSITIONS=139} [2024-06-28 01:56:08,203 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2024-06-28 01:56:08,203 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 139 transitions, 1148 flow [2024-06-28 01:56:08,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:08,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:08,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:08,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:56:08,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:08,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1932102183, now seen corresponding path program 3 times [2024-06-28 01:56:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74345633] [2024-06-28 01:56:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:08,826 INFO L134 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:56:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74345633] [2024-06-28 01:56:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74345633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393391807] [2024-06-28 01:56:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:08,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:08,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:08,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 139 transitions, 1148 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:08,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:08,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:08,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:09,738 INFO L124 PetriNetUnfolderBase]: 4794/7561 cut-off events. [2024-06-28 01:56:09,738 INFO L125 PetriNetUnfolderBase]: For 33130/33133 co-relation queries the response was YES. [2024-06-28 01:56:09,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29266 conditions, 7561 events. 4794/7561 cut-off events. For 33130/33133 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 45581 event pairs, 1924 based on Foata normal form. 6/7331 useless extension candidates. Maximal degree in co-relation 29219. Up to 6787 conditions per place. [2024-06-28 01:56:09,780 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 144 selfloop transitions, 15 changer transitions 0/166 dead transitions. [2024-06-28 01:56:09,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1550 flow [2024-06-28 01:56:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:56:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:56:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-28 01:56:09,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746376811594203 [2024-06-28 01:56:09,782 INFO L175 Difference]: Start difference. First operand has 101 places, 139 transitions, 1148 flow. Second operand 6 states and 131 transitions. [2024-06-28 01:56:09,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1550 flow [2024-06-28 01:56:09,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1500 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:56:09,813 INFO L231 Difference]: Finished difference. Result has 103 places, 140 transitions, 1146 flow [2024-06-28 01:56:09,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1146, PETRI_PLACES=103, PETRI_TRANSITIONS=140} [2024-06-28 01:56:09,814 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2024-06-28 01:56:09,814 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 140 transitions, 1146 flow [2024-06-28 01:56:09,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:56:09,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:09,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:56:09,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:09,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1932112072, now seen corresponding path program 1 times [2024-06-28 01:56:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040647340] [2024-06-28 01:56:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:10,808 INFO L134 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:56:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040647340] [2024-06-28 01:56:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040647340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879150466] [2024-06-28 01:56:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:10,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:10,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:10,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 140 transitions, 1146 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:10,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:10,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:10,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:11,767 INFO L124 PetriNetUnfolderBase]: 4786/7549 cut-off events. [2024-06-28 01:56:11,768 INFO L125 PetriNetUnfolderBase]: For 32933/32936 co-relation queries the response was YES. [2024-06-28 01:56:11,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29023 conditions, 7549 events. 4786/7549 cut-off events. For 32933/32936 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 45646 event pairs, 1855 based on Foata normal form. 6/7319 useless extension candidates. Maximal degree in co-relation 28976. Up to 6738 conditions per place. [2024-06-28 01:56:11,813 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 153 selfloop transitions, 17 changer transitions 0/177 dead transitions. [2024-06-28 01:56:11,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 1624 flow [2024-06-28 01:56:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:56:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:56:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-28 01:56:11,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2024-06-28 01:56:11,815 INFO L175 Difference]: Start difference. First operand has 103 places, 140 transitions, 1146 flow. Second operand 6 states and 135 transitions. [2024-06-28 01:56:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 1624 flow [2024-06-28 01:56:11,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 177 transitions, 1594 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:11,842 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 1175 flow [2024-06-28 01:56:11,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1175, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2024-06-28 01:56:11,843 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2024-06-28 01:56:11,843 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 1175 flow [2024-06-28 01:56:11,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:11,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:11,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:56:11,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:11,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 411621713, now seen corresponding path program 1 times [2024-06-28 01:56:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073145742] [2024-06-28 01:56:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:12,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073145742] [2024-06-28 01:56:12,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073145742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:12,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:12,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:12,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994561933] [2024-06-28 01:56:12,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:12,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:12,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:12,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:12,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:12,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:12,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 1175 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:12,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:12,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:12,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:13,762 INFO L124 PetriNetUnfolderBase]: 5124/8018 cut-off events. [2024-06-28 01:56:13,763 INFO L125 PetriNetUnfolderBase]: For 45071/45424 co-relation queries the response was YES. [2024-06-28 01:56:13,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32912 conditions, 8018 events. 5124/8018 cut-off events. For 45071/45424 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 48740 event pairs, 1587 based on Foata normal form. 105/7763 useless extension candidates. Maximal degree in co-relation 32864. Up to 6650 conditions per place. [2024-06-28 01:56:13,814 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 175 selfloop transitions, 73 changer transitions 0/266 dead transitions. [2024-06-28 01:56:13,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 266 transitions, 2571 flow [2024-06-28 01:56:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-28 01:56:13,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2024-06-28 01:56:13,818 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 1175 flow. Second operand 9 states and 213 transitions. [2024-06-28 01:56:13,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 266 transitions, 2571 flow [2024-06-28 01:56:13,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 266 transitions, 2524 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 01:56:13,873 INFO L231 Difference]: Finished difference. Result has 116 places, 201 transitions, 1956 flow [2024-06-28 01:56:13,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1956, PETRI_PLACES=116, PETRI_TRANSITIONS=201} [2024-06-28 01:56:13,875 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2024-06-28 01:56:13,875 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 201 transitions, 1956 flow [2024-06-28 01:56:13,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:13,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:13,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:13,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:56:13,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:13,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2023997889, now seen corresponding path program 2 times [2024-06-28 01:56:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827370024] [2024-06-28 01:56:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827370024] [2024-06-28 01:56:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827370024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870941244] [2024-06-28 01:56:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:14,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:14,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:14,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 201 transitions, 1956 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:14,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:14,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:15,903 INFO L124 PetriNetUnfolderBase]: 5222/8115 cut-off events. [2024-06-28 01:56:15,904 INFO L125 PetriNetUnfolderBase]: For 62205/62825 co-relation queries the response was YES. [2024-06-28 01:56:15,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37528 conditions, 8115 events. 5222/8115 cut-off events. For 62205/62825 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 48833 event pairs, 1486 based on Foata normal form. 247/8013 useless extension candidates. Maximal degree in co-relation 37474. Up to 6574 conditions per place. [2024-06-28 01:56:15,963 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 182 selfloop transitions, 98 changer transitions 0/298 dead transitions. [2024-06-28 01:56:15,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 298 transitions, 3211 flow [2024-06-28 01:56:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-28 01:56:15,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2024-06-28 01:56:15,965 INFO L175 Difference]: Start difference. First operand has 116 places, 201 transitions, 1956 flow. Second operand 8 states and 202 transitions. [2024-06-28 01:56:15,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 298 transitions, 3211 flow [2024-06-28 01:56:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 298 transitions, 3171 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-28 01:56:16,046 INFO L231 Difference]: Finished difference. Result has 126 places, 235 transitions, 2585 flow [2024-06-28 01:56:16,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2585, PETRI_PLACES=126, PETRI_TRANSITIONS=235} [2024-06-28 01:56:16,047 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 74 predicate places. [2024-06-28 01:56:16,047 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 235 transitions, 2585 flow [2024-06-28 01:56:16,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:16,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:16,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:16,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:56:16,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:16,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 394450020, now seen corresponding path program 1 times [2024-06-28 01:56:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29960625] [2024-06-28 01:56:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:16,749 INFO L134 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:56:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:16,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29960625] [2024-06-28 01:56:16,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29960625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:16,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345810141] [2024-06-28 01:56:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:16,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:16,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:16,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 235 transitions, 2585 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:16,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:16,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:16,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:17,875 INFO L124 PetriNetUnfolderBase]: 5642/8683 cut-off events. [2024-06-28 01:56:17,875 INFO L125 PetriNetUnfolderBase]: For 69729/69744 co-relation queries the response was YES. [2024-06-28 01:56:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42551 conditions, 8683 events. 5642/8683 cut-off events. For 69729/69744 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 51330 event pairs, 1575 based on Foata normal form. 16/8474 useless extension candidates. Maximal degree in co-relation 42491. Up to 7470 conditions per place. [2024-06-28 01:56:17,937 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 267 selfloop transitions, 54 changer transitions 0/328 dead transitions. [2024-06-28 01:56:17,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 328 transitions, 3894 flow [2024-06-28 01:56:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-28 01:56:17,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-28 01:56:17,939 INFO L175 Difference]: Start difference. First operand has 126 places, 235 transitions, 2585 flow. Second operand 8 states and 192 transitions. [2024-06-28 01:56:17,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 328 transitions, 3894 flow [2024-06-28 01:56:18,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 328 transitions, 3797 flow, removed 37 selfloop flow, removed 2 redundant places. [2024-06-28 01:56:18,029 INFO L231 Difference]: Finished difference. Result has 134 places, 258 transitions, 2941 flow [2024-06-28 01:56:18,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2941, PETRI_PLACES=134, PETRI_TRANSITIONS=258} [2024-06-28 01:56:18,030 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 82 predicate places. [2024-06-28 01:56:18,030 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 258 transitions, 2941 flow [2024-06-28 01:56:18,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:18,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:18,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:18,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:56:18,030 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:18,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash 415431148, now seen corresponding path program 2 times [2024-06-28 01:56:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:18,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069272783] [2024-06-28 01:56:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:18,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:18,723 INFO L134 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:56:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069272783] [2024-06-28 01:56:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069272783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133596882] [2024-06-28 01:56:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:18,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:18,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:18,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 258 transitions, 2941 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:18,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:18,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:18,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:20,183 INFO L124 PetriNetUnfolderBase]: 5756/8848 cut-off events. [2024-06-28 01:56:20,184 INFO L125 PetriNetUnfolderBase]: For 76532/76551 co-relation queries the response was YES. [2024-06-28 01:56:20,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44999 conditions, 8848 events. 5756/8848 cut-off events. For 76532/76551 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 52188 event pairs, 1620 based on Foata normal form. 20/8640 useless extension candidates. Maximal degree in co-relation 44935. Up to 7793 conditions per place. [2024-06-28 01:56:20,252 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 276 selfloop transitions, 45 changer transitions 0/328 dead transitions. [2024-06-28 01:56:20,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 328 transitions, 4014 flow [2024-06-28 01:56:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-28 01:56:20,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-06-28 01:56:20,254 INFO L175 Difference]: Start difference. First operand has 134 places, 258 transitions, 2941 flow. Second operand 8 states and 190 transitions. [2024-06-28 01:56:20,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 328 transitions, 4014 flow [2024-06-28 01:56:20,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 328 transitions, 3936 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:20,352 INFO L231 Difference]: Finished difference. Result has 140 places, 267 transitions, 3088 flow [2024-06-28 01:56:20,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3088, PETRI_PLACES=140, PETRI_TRANSITIONS=267} [2024-06-28 01:56:20,353 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 88 predicate places. [2024-06-28 01:56:20,353 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 267 transitions, 3088 flow [2024-06-28 01:56:20,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:20,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:20,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:20,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:56:20,354 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:20,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1248454367, now seen corresponding path program 3 times [2024-06-28 01:56:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349275334] [2024-06-28 01:56:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:21,132 INFO L134 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:56:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349275334] [2024-06-28 01:56:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349275334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492397983] [2024-06-28 01:56:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:21,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:21,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 267 transitions, 3088 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:21,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:21,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:21,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:22,503 INFO L124 PetriNetUnfolderBase]: 5517/8560 cut-off events. [2024-06-28 01:56:22,504 INFO L125 PetriNetUnfolderBase]: For 91828/92345 co-relation queries the response was YES. [2024-06-28 01:56:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45332 conditions, 8560 events. 5517/8560 cut-off events. For 91828/92345 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 51572 event pairs, 1528 based on Foata normal form. 59/8261 useless extension candidates. Maximal degree in co-relation 45265. Up to 7464 conditions per place. [2024-06-28 01:56:22,567 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 233 selfloop transitions, 69 changer transitions 0/325 dead transitions. [2024-06-28 01:56:22,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 325 transitions, 3999 flow [2024-06-28 01:56:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-28 01:56:22,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-28 01:56:22,572 INFO L175 Difference]: Start difference. First operand has 140 places, 267 transitions, 3088 flow. Second operand 8 states and 187 transitions. [2024-06-28 01:56:22,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 325 transitions, 3999 flow [2024-06-28 01:56:22,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 325 transitions, 3963 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:22,716 INFO L231 Difference]: Finished difference. Result has 145 places, 275 transitions, 3330 flow [2024-06-28 01:56:22,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3330, PETRI_PLACES=145, PETRI_TRANSITIONS=275} [2024-06-28 01:56:22,718 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 93 predicate places. [2024-06-28 01:56:22,718 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 275 transitions, 3330 flow [2024-06-28 01:56:22,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:22,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:22,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:22,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:56:22,720 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:22,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1248448632, now seen corresponding path program 3 times [2024-06-28 01:56:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:22,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896700542] [2024-06-28 01:56:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:23,440 INFO L134 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:56:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896700542] [2024-06-28 01:56:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896700542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116046523] [2024-06-28 01:56:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:23,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:23,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:23,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 275 transitions, 3330 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:23,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:23,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:23,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:24,896 INFO L124 PetriNetUnfolderBase]: 5828/8952 cut-off events. [2024-06-28 01:56:24,896 INFO L125 PetriNetUnfolderBase]: For 89751/89770 co-relation queries the response was YES. [2024-06-28 01:56:24,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47640 conditions, 8952 events. 5828/8952 cut-off events. For 89751/89770 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 52892 event pairs, 1621 based on Foata normal form. 20/8742 useless extension candidates. Maximal degree in co-relation 47571. Up to 7897 conditions per place. [2024-06-28 01:56:24,967 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 295 selfloop transitions, 49 changer transitions 0/351 dead transitions. [2024-06-28 01:56:24,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 351 transitions, 4345 flow [2024-06-28 01:56:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2024-06-28 01:56:24,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:56:24,970 INFO L175 Difference]: Start difference. First operand has 145 places, 275 transitions, 3330 flow. Second operand 10 states and 230 transitions. [2024-06-28 01:56:24,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 351 transitions, 4345 flow [2024-06-28 01:56:25,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 351 transitions, 4143 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:25,115 INFO L231 Difference]: Finished difference. Result has 149 places, 276 transitions, 3244 flow [2024-06-28 01:56:25,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3130, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3244, PETRI_PLACES=149, PETRI_TRANSITIONS=276} [2024-06-28 01:56:25,116 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 97 predicate places. [2024-06-28 01:56:25,116 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 276 transitions, 3244 flow [2024-06-28 01:56:25,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:25,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:25,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:25,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:56:25,117 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:25,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash -234077837, now seen corresponding path program 1 times [2024-06-28 01:56:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703237385] [2024-06-28 01:56:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:25,969 INFO L134 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:56:25,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:25,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703237385] [2024-06-28 01:56:25,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703237385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:25,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:25,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797825130] [2024-06-28 01:56:25,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:25,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:25,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:26,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:26,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 276 transitions, 3244 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:26,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:26,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:26,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:27,180 INFO L124 PetriNetUnfolderBase]: 5839/9023 cut-off events. [2024-06-28 01:56:27,181 INFO L125 PetriNetUnfolderBase]: For 95196/95199 co-relation queries the response was YES. [2024-06-28 01:56:27,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47737 conditions, 9023 events. 5839/9023 cut-off events. For 95196/95199 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 53688 event pairs, 2027 based on Foata normal form. 4/8785 useless extension candidates. Maximal degree in co-relation 47667. Up to 8146 conditions per place. [2024-06-28 01:56:27,251 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 282 selfloop transitions, 24 changer transitions 0/313 dead transitions. [2024-06-28 01:56:27,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 313 transitions, 4030 flow [2024-06-28 01:56:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:56:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:56:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-28 01:56:27,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2024-06-28 01:56:27,252 INFO L175 Difference]: Start difference. First operand has 149 places, 276 transitions, 3244 flow. Second operand 6 states and 136 transitions. [2024-06-28 01:56:27,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 313 transitions, 4030 flow [2024-06-28 01:56:27,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 313 transitions, 3928 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:27,382 INFO L231 Difference]: Finished difference. Result has 147 places, 279 transitions, 3238 flow [2024-06-28 01:56:27,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3142, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3238, PETRI_PLACES=147, PETRI_TRANSITIONS=279} [2024-06-28 01:56:27,382 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 95 predicate places. [2024-06-28 01:56:27,382 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 279 transitions, 3238 flow [2024-06-28 01:56:27,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:27,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:27,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:56:27,383 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:27,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -242619174, now seen corresponding path program 4 times [2024-06-28 01:56:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448291360] [2024-06-28 01:56:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:27,986 INFO L134 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:56:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448291360] [2024-06-28 01:56:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448291360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504932643] [2024-06-28 01:56:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:28,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:28,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 279 transitions, 3238 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:28,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:28,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:28,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:29,294 INFO L124 PetriNetUnfolderBase]: 5953/9131 cut-off events. [2024-06-28 01:56:29,294 INFO L125 PetriNetUnfolderBase]: For 101850/101855 co-relation queries the response was YES. [2024-06-28 01:56:29,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49479 conditions, 9131 events. 5953/9131 cut-off events. For 101850/101855 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 53926 event pairs, 1689 based on Foata normal form. 6/8906 useless extension candidates. Maximal degree in co-relation 49408. Up to 8072 conditions per place. [2024-06-28 01:56:29,388 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 292 selfloop transitions, 40 changer transitions 0/339 dead transitions. [2024-06-28 01:56:29,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 339 transitions, 4380 flow [2024-06-28 01:56:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-28 01:56:29,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248447204968945 [2024-06-28 01:56:29,390 INFO L175 Difference]: Start difference. First operand has 147 places, 279 transitions, 3238 flow. Second operand 7 states and 169 transitions. [2024-06-28 01:56:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 339 transitions, 4380 flow [2024-06-28 01:56:29,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 339 transitions, 4326 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 01:56:29,547 INFO L231 Difference]: Finished difference. Result has 151 places, 287 transitions, 3387 flow [2024-06-28 01:56:29,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3184, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3387, PETRI_PLACES=151, PETRI_TRANSITIONS=287} [2024-06-28 01:56:29,548 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 99 predicate places. [2024-06-28 01:56:29,548 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 287 transitions, 3387 flow [2024-06-28 01:56:29,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:29,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:29,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:29,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:56:29,549 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:29,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -242624909, now seen corresponding path program 4 times [2024-06-28 01:56:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595333222] [2024-06-28 01:56:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:30,279 INFO L134 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:56:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595333222] [2024-06-28 01:56:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595333222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501151667] [2024-06-28 01:56:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:30,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:30,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:30,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 287 transitions, 3387 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:30,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:30,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:30,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:31,706 INFO L124 PetriNetUnfolderBase]: 5738/8861 cut-off events. [2024-06-28 01:56:31,706 INFO L125 PetriNetUnfolderBase]: For 121727/122341 co-relation queries the response was YES. [2024-06-28 01:56:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50349 conditions, 8861 events. 5738/8861 cut-off events. For 121727/122341 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 53309 event pairs, 1498 based on Foata normal form. 122/8620 useless extension candidates. Maximal degree in co-relation 50276. Up to 7432 conditions per place. [2024-06-28 01:56:31,779 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 240 selfloop transitions, 86 changer transitions 0/353 dead transitions. [2024-06-28 01:56:31,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 353 transitions, 4553 flow [2024-06-28 01:56:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-28 01:56:31,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.562111801242236 [2024-06-28 01:56:31,781 INFO L175 Difference]: Start difference. First operand has 151 places, 287 transitions, 3387 flow. Second operand 7 states and 181 transitions. [2024-06-28 01:56:31,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 353 transitions, 4553 flow [2024-06-28 01:56:31,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 353 transitions, 4486 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:31,964 INFO L231 Difference]: Finished difference. Result has 157 places, 300 transitions, 3787 flow [2024-06-28 01:56:31,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3320, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3787, PETRI_PLACES=157, PETRI_TRANSITIONS=300} [2024-06-28 01:56:31,965 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 105 predicate places. [2024-06-28 01:56:31,965 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 300 transitions, 3787 flow [2024-06-28 01:56:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:31,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:31,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:31,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:56:31,966 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:31,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1608616836, now seen corresponding path program 5 times [2024-06-28 01:56:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029064515] [2024-06-28 01:56:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:32,633 INFO L134 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:56:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029064515] [2024-06-28 01:56:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029064515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109613163] [2024-06-28 01:56:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:32,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:32,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 300 transitions, 3787 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:32,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:32,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:32,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:34,002 INFO L124 PetriNetUnfolderBase]: 6059/9263 cut-off events. [2024-06-28 01:56:34,003 INFO L125 PetriNetUnfolderBase]: For 116128/116147 co-relation queries the response was YES. [2024-06-28 01:56:34,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52132 conditions, 9263 events. 6059/9263 cut-off events. For 116128/116147 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 54689 event pairs, 1667 based on Foata normal form. 20/9054 useless extension candidates. Maximal degree in co-relation 52056. Up to 8219 conditions per place. [2024-06-28 01:56:34,083 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 302 selfloop transitions, 44 changer transitions 0/353 dead transitions. [2024-06-28 01:56:34,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 353 transitions, 4823 flow [2024-06-28 01:56:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-28 01:56:34,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2024-06-28 01:56:34,084 INFO L175 Difference]: Start difference. First operand has 157 places, 300 transitions, 3787 flow. Second operand 7 states and 170 transitions. [2024-06-28 01:56:34,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 353 transitions, 4823 flow [2024-06-28 01:56:34,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 353 transitions, 4702 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:34,404 INFO L231 Difference]: Finished difference. Result has 161 places, 300 transitions, 3769 flow [2024-06-28 01:56:34,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3672, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3769, PETRI_PLACES=161, PETRI_TRANSITIONS=300} [2024-06-28 01:56:34,405 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 109 predicate places. [2024-06-28 01:56:34,405 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 300 transitions, 3769 flow [2024-06-28 01:56:34,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:34,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:34,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:34,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:56:34,406 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:34,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:34,406 INFO L85 PathProgramCache]: Analyzing trace with hash -234373794, now seen corresponding path program 6 times [2024-06-28 01:56:34,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913668169] [2024-06-28 01:56:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:35,004 INFO L134 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:56:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913668169] [2024-06-28 01:56:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913668169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065112815] [2024-06-28 01:56:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:35,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:56:35,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 300 transitions, 3769 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:35,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:35,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:56:35,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:36,456 INFO L124 PetriNetUnfolderBase]: 6049/9272 cut-off events. [2024-06-28 01:56:36,456 INFO L125 PetriNetUnfolderBase]: For 123239/123242 co-relation queries the response was YES. [2024-06-28 01:56:36,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51956 conditions, 9272 events. 6049/9272 cut-off events. For 123239/123242 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 54893 event pairs, 2064 based on Foata normal form. 6/9048 useless extension candidates. Maximal degree in co-relation 51879. Up to 8444 conditions per place. [2024-06-28 01:56:36,515 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 310 selfloop transitions, 19 changer transitions 0/336 dead transitions. [2024-06-28 01:56:36,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 336 transitions, 4558 flow [2024-06-28 01:56:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-06-28 01:56:36,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-28 01:56:36,517 INFO L175 Difference]: Start difference. First operand has 161 places, 300 transitions, 3769 flow. Second operand 7 states and 154 transitions. [2024-06-28 01:56:36,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 336 transitions, 4558 flow [2024-06-28 01:56:36,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 336 transitions, 4406 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:36,663 INFO L231 Difference]: Finished difference. Result has 162 places, 301 transitions, 3678 flow [2024-06-28 01:56:36,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3623, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3678, PETRI_PLACES=162, PETRI_TRANSITIONS=301} [2024-06-28 01:56:36,664 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 110 predicate places. [2024-06-28 01:56:36,664 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 301 transitions, 3678 flow [2024-06-28 01:56:36,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:56:36,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:36,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:36,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:56:36,664 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:36,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1520784483, now seen corresponding path program 5 times [2024-06-28 01:56:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442726535] [2024-06-28 01:56:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:37,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:56:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442726535] [2024-06-28 01:56:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442726535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:37,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:37,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220375093] [2024-06-28 01:56:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:37,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:37,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:37,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 301 transitions, 3678 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:37,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:37,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:37,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:38,867 INFO L124 PetriNetUnfolderBase]: 6356/9759 cut-off events. [2024-06-28 01:56:38,867 INFO L125 PetriNetUnfolderBase]: For 149640/150227 co-relation queries the response was YES. [2024-06-28 01:56:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56931 conditions, 9759 events. 6356/9759 cut-off events. For 149640/150227 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 59080 event pairs, 1723 based on Foata normal form. 141/9508 useless extension candidates. Maximal degree in co-relation 56854. Up to 8244 conditions per place. [2024-06-28 01:56:38,939 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 328 selfloop transitions, 176 changer transitions 0/532 dead transitions. [2024-06-28 01:56:38,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 532 transitions, 7184 flow [2024-06-28 01:56:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-06-28 01:56:38,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152173913043478 [2024-06-28 01:56:38,940 INFO L175 Difference]: Start difference. First operand has 162 places, 301 transitions, 3678 flow. Second operand 10 states and 237 transitions. [2024-06-28 01:56:38,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 532 transitions, 7184 flow [2024-06-28 01:56:39,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 532 transitions, 7150 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:56:39,159 INFO L231 Difference]: Finished difference. Result has 172 places, 462 transitions, 6574 flow [2024-06-28 01:56:39,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3644, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6574, PETRI_PLACES=172, PETRI_TRANSITIONS=462} [2024-06-28 01:56:39,159 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 120 predicate places. [2024-06-28 01:56:39,159 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 462 transitions, 6574 flow [2024-06-28 01:56:39,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:39,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:39,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:56:39,160 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:39,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 250702549, now seen corresponding path program 6 times [2024-06-28 01:56:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:39,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418385321] [2024-06-28 01:56:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:39,879 INFO L134 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:56:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:39,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418385321] [2024-06-28 01:56:39,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418385321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:39,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:39,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994985072] [2024-06-28 01:56:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:39,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:39,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:39,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 462 transitions, 6574 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:39,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:39,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:39,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:41,798 INFO L124 PetriNetUnfolderBase]: 7207/11011 cut-off events. [2024-06-28 01:56:41,798 INFO L125 PetriNetUnfolderBase]: For 190700/191824 co-relation queries the response was YES. [2024-06-28 01:56:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71041 conditions, 11011 events. 7207/11011 cut-off events. For 190700/191824 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 67540 event pairs, 1742 based on Foata normal form. 303/10870 useless extension candidates. Maximal degree in co-relation 70958. Up to 8956 conditions per place. [2024-06-28 01:56:41,911 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 384 selfloop transitions, 372 changer transitions 0/784 dead transitions. [2024-06-28 01:56:41,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 784 transitions, 12444 flow [2024-06-28 01:56:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-06-28 01:56:41,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195652173913043 [2024-06-28 01:56:41,912 INFO L175 Difference]: Start difference. First operand has 172 places, 462 transitions, 6574 flow. Second operand 10 states and 239 transitions. [2024-06-28 01:56:41,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 784 transitions, 12444 flow [2024-06-28 01:56:42,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 784 transitions, 12268 flow, removed 80 selfloop flow, removed 2 redundant places. [2024-06-28 01:56:42,432 INFO L231 Difference]: Finished difference. Result has 185 places, 700 transitions, 11711 flow [2024-06-28 01:56:42,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6488, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11711, PETRI_PLACES=185, PETRI_TRANSITIONS=700} [2024-06-28 01:56:42,433 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 133 predicate places. [2024-06-28 01:56:42,433 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 700 transitions, 11711 flow [2024-06-28 01:56:42,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:56:42,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:42,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:56:42,434 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:42,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash -202316391, now seen corresponding path program 7 times [2024-06-28 01:56:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563743853] [2024-06-28 01:56:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563743853] [2024-06-28 01:56:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563743853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:42,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998239827] [2024-06-28 01:56:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:42,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-06-28 01:56:42,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 700 transitions, 11711 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:42,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:42,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-06-28 01:56:42,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:44,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([360] L796-->L803: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse4 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_36 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_77 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~z$w_buff0~0_31 (ite .cse1 v_~z$w_buff1~0_26 v_~z~0_36)) v_~z~0_35) (= v_~z$r_buff0_thd3~0_35 (ite .cse2 0 v_~z$r_buff0_thd3~0_36)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_35 256) 0))) (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_76 256))))) 0 v_~z$r_buff1_thd3~0_28) v_~z$r_buff1_thd3~0_27) (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_77) v_~z$w_buff1_used~0_76)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_31, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_36, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~z~0=v_~z~0_36} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_31, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_76, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][359], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 201#true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 86#true, 218#true, Black: 395#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 397#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 16#L753true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 135#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 367#true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 314#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 406#true, 111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 385#true, 233#true, Black: 195#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 328#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L836true, Black: 225#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 17#L803true, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 241#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 13#L783true, Black: 372#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 371#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 01:56:44,832 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,832 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,832 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,832 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L836-->L852: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd0~0_94 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd0~0_98 256) 0))) (let ((.cse8 (not .cse6)) (.cse3 (and .cse6 (= (mod v_~z$w_buff1_used~0_139 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_148 256) 0)) (.cse4 (and .cse6 .cse10))) (let ((.cse1 (or .cse3 .cse12 .cse4)) (.cse2 (and (not .cse12) .cse8))) (let ((.cse5 (= 0 (mod v_~z$w_buff0_used~0_147 256))) (.cse7 (= (mod v_~z$w_buff1_used~0_138 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_46 256) 0))) (.cse11 (ite .cse1 v_~z~0_111 (ite .cse2 v_~z$w_buff0~0_68 v_~z$w_buff1~0_95)))) (and (= v_~z$w_buff0_used~0_147 (ite .cse0 v_~z$w_buff0_used~0_148 (ite .cse1 v_~z$w_buff0_used~0_148 (ite .cse2 0 v_~z$w_buff0_used~0_148)))) (= v_~z$w_buff1_used~0_138 (ite .cse0 v_~z$w_buff1_used~0_139 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_139 0))) (or (= v_~weak$$choice2~0_46 0) (= v_~weak$$choice2~0_46 1)) (= v_~z$r_buff0_thd0~0_97 (ite .cse0 v_~z$r_buff0_thd0~0_98 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd0~0_98 (ite (and (not .cse5) .cse8) 0 v_~z$r_buff0_thd0~0_98)))) (= v_~z$w_buff1~0_95 v_~z$w_buff1~0_94) (= v_~z$r_buff1_thd0~0_93 (ite .cse0 v_~z$r_buff1_thd0~0_94 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_97 256) 0))) (or .cse5 (and .cse9 .cse7) (and .cse9 .cse10))) v_~z$r_buff1_thd0~0_94 0))) (= v_~z$flush_delayed~0_57 0) (= (ite .cse0 v_~z$mem_tmp~0_50 .cse11) v_~z~0_109) (or (= v_~weak$$choice0~0_35 1) (= v_~weak$$choice0~0_35 0)) (= v_~z$mem_tmp~0_50 v_~z~0_111) (= (ite (= (ite (not (and (= .cse11 2) (= v_~__unbuffered_p2_EAX~0_44 1) (= v_~__unbuffered_p1_EAX~0_44 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= v_~z$w_buff0~0_68 v_~z$w_buff0~0_67)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_98, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_148, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_139, ~z$w_buff1~0=v_~z$w_buff1~0_95, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~z~0=v_~z~0_111} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_50, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_147, ~z$w_buff0~0=v_~z$w_buff0~0_67, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_49|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_97, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~z~0=v_~z~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_46} AuxVars[] AssignedVars[~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet9#1, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~z~0, ~weak$$choice2~0][554], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 201#true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 86#true, 218#true, Black: 395#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 397#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 9#L852true, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 16#L753true, 6#L796true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 135#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 367#true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 314#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 406#true, 111#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 385#true, 233#true, Black: 195#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 328#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 241#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 13#L783true, Black: 372#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 371#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 01:56:44,834 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,834 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,834 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,834 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:56:44,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][192], [Black: 375#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 201#true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 86#true, 218#true, Black: 395#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 397#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 399#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 393#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 45#L756true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 284#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 6#L796true, Black: 169#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 135#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 367#true, Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 314#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 111#true, 406#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 385#true, 233#true, Black: 195#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 328#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 98#true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 8#L836true, Black: 225#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 71#true, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 241#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 13#L783true, Black: 372#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 371#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (or (= 2 ~z~0) (= ~z~0 0)) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 01:56:44,926 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-06-28 01:56:44,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:44,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:44,926 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-28 01:56:45,255 INFO L124 PetriNetUnfolderBase]: 7914/12016 cut-off events. [2024-06-28 01:56:45,255 INFO L125 PetriNetUnfolderBase]: For 224452/225479 co-relation queries the response was YES. [2024-06-28 01:56:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82077 conditions, 12016 events. 7914/12016 cut-off events. For 224452/225479 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 74718 event pairs, 1661 based on Foata normal form. 369/11751 useless extension candidates. Maximal degree in co-relation 81987. Up to 8039 conditions per place. [2024-06-28 01:56:45,369 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 355 selfloop transitions, 418 changer transitions 0/891 dead transitions. [2024-06-28 01:56:45,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 891 transitions, 15424 flow [2024-06-28 01:56:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-28 01:56:45,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5679347826086957 [2024-06-28 01:56:45,371 INFO L175 Difference]: Start difference. First operand has 185 places, 700 transitions, 11711 flow. Second operand 8 states and 209 transitions. [2024-06-28 01:56:45,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 891 transitions, 15424 flow [2024-06-28 01:56:45,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 891 transitions, 15272 flow, removed 68 selfloop flow, removed 2 redundant places. [2024-06-28 01:56:45,976 INFO L231 Difference]: Finished difference. Result has 193 places, 832 transitions, 14460 flow [2024-06-28 01:56:45,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11613, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14460, PETRI_PLACES=193, PETRI_TRANSITIONS=832} [2024-06-28 01:56:45,981 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 141 predicate places. [2024-06-28 01:56:45,981 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 832 transitions, 14460 flow [2024-06-28 01:56:45,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:45,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:45,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:45,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:56:45,982 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:45,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash -923813719, now seen corresponding path program 1 times [2024-06-28 01:56:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:45,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264368230] [2024-06-28 01:56:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:46,600 INFO L134 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:56:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264368230] [2024-06-28 01:56:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264368230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:56:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921321173] [2024-06-28 01:56:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:56:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:46,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:56:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:56:46,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:46,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 832 transitions, 14460 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:56:46,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:46,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:46,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:49,371 INFO L124 PetriNetUnfolderBase]: 8552/12861 cut-off events. [2024-06-28 01:56:49,372 INFO L125 PetriNetUnfolderBase]: For 250927/253208 co-relation queries the response was YES. [2024-06-28 01:56:49,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92369 conditions, 12861 events. 8552/12861 cut-off events. For 250927/253208 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 78089 event pairs, 2443 based on Foata normal form. 1509/14028 useless extension candidates. Maximal degree in co-relation 92275. Up to 11582 conditions per place. [2024-06-28 01:56:49,515 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 768 selfloop transitions, 27 changer transitions 0/849 dead transitions. [2024-06-28 01:56:49,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 849 transitions, 16144 flow [2024-06-28 01:56:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:56:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:56:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-28 01:56:49,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826086956521739 [2024-06-28 01:56:49,517 INFO L175 Difference]: Start difference. First operand has 193 places, 832 transitions, 14460 flow. Second operand 5 states and 111 transitions. [2024-06-28 01:56:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 849 transitions, 16144 flow [2024-06-28 01:56:50,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 849 transitions, 16019 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:50,217 INFO L231 Difference]: Finished difference. Result has 196 places, 835 transitions, 14453 flow [2024-06-28 01:56:50,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14339, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14453, PETRI_PLACES=196, PETRI_TRANSITIONS=835} [2024-06-28 01:56:50,219 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 144 predicate places. [2024-06-28 01:56:50,219 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 835 transitions, 14453 flow [2024-06-28 01:56:50,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:56:50,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:50,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:50,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:56:50,219 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:50,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -165469444, now seen corresponding path program 1 times [2024-06-28 01:56:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005037852] [2024-06-28 01:56:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:51,064 INFO L134 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:56:51,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005037852] [2024-06-28 01:56:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005037852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050079301] [2024-06-28 01:56:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:51,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:51,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:51,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 835 transitions, 14453 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:56:51,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:51,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:51,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:54,055 INFO L124 PetriNetUnfolderBase]: 8606/12961 cut-off events. [2024-06-28 01:56:54,056 INFO L125 PetriNetUnfolderBase]: For 283248/284888 co-relation queries the response was YES. [2024-06-28 01:56:54,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96304 conditions, 12961 events. 8606/12961 cut-off events. For 283248/284888 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 79833 event pairs, 1350 based on Foata normal form. 287/12778 useless extension candidates. Maximal degree in co-relation 96207. Up to 8092 conditions per place. [2024-06-28 01:56:54,162 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 401 selfloop transitions, 527 changer transitions 0/956 dead transitions. [2024-06-28 01:56:54,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 956 transitions, 17715 flow [2024-06-28 01:56:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-06-28 01:56:54,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5700483091787439 [2024-06-28 01:56:54,164 INFO L175 Difference]: Start difference. First operand has 196 places, 835 transitions, 14453 flow. Second operand 9 states and 236 transitions. [2024-06-28 01:56:54,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 956 transitions, 17715 flow [2024-06-28 01:56:54,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 956 transitions, 17678 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 01:56:54,828 INFO L231 Difference]: Finished difference. Result has 205 places, 859 transitions, 16366 flow [2024-06-28 01:56:54,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14416, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16366, PETRI_PLACES=205, PETRI_TRANSITIONS=859} [2024-06-28 01:56:54,829 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 153 predicate places. [2024-06-28 01:56:54,829 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 859 transitions, 16366 flow [2024-06-28 01:56:54,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:56:54,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:54,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:54,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:56:54,830 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:56:54,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash -165466654, now seen corresponding path program 2 times [2024-06-28 01:56:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898620470] [2024-06-28 01:56:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:55,660 INFO L134 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:56:55,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898620470] [2024-06-28 01:56:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898620470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:55,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912488612] [2024-06-28 01:56:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:55,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:55,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:55,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:56:55,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 859 transitions, 16366 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:56:55,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:55,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:56:55,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:58,796 INFO L124 PetriNetUnfolderBase]: 8835/13287 cut-off events. [2024-06-28 01:56:58,796 INFO L125 PetriNetUnfolderBase]: For 344235/346134 co-relation queries the response was YES. [2024-06-28 01:56:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105997 conditions, 13287 events. 8835/13287 cut-off events. For 344235/346134 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 82104 event pairs, 1674 based on Foata normal form. 650/13465 useless extension candidates. Maximal degree in co-relation 105896. Up to 9338 conditions per place. [2024-06-28 01:56:58,950 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 391 selfloop transitions, 544 changer transitions 0/963 dead transitions. [2024-06-28 01:56:58,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 963 transitions, 19350 flow [2024-06-28 01:56:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-06-28 01:56:58,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5603864734299517 [2024-06-28 01:56:58,952 INFO L175 Difference]: Start difference. First operand has 205 places, 859 transitions, 16366 flow. Second operand 9 states and 232 transitions. [2024-06-28 01:56:58,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 963 transitions, 19350 flow [2024-06-28 01:57:00,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 963 transitions, 18973 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:00,061 INFO L231 Difference]: Finished difference. Result has 211 places, 870 transitions, 17434 flow [2024-06-28 01:57:00,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15999, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=533, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17434, PETRI_PLACES=211, PETRI_TRANSITIONS=870} [2024-06-28 01:57:00,062 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 159 predicate places. [2024-06-28 01:57:00,062 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 870 transitions, 17434 flow [2024-06-28 01:57:00,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:57:00,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:00,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:00,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:57:00,063 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:00,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash -124627922, now seen corresponding path program 1 times [2024-06-28 01:57:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:00,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744952174] [2024-06-28 01:57:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:00,871 INFO L134 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:57:00,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744952174] [2024-06-28 01:57:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744952174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:00,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:00,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645594420] [2024-06-28 01:57:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:00,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:00,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:00,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:00,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 870 transitions, 17434 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:00,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:00,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:00,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:04,698 INFO L124 PetriNetUnfolderBase]: 9803/14525 cut-off events. [2024-06-28 01:57:04,699 INFO L125 PetriNetUnfolderBase]: For 341648/341655 co-relation queries the response was YES. [2024-06-28 01:57:04,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117087 conditions, 14525 events. 9803/14525 cut-off events. For 341648/341655 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 87872 event pairs, 1997 based on Foata normal form. 8/14276 useless extension candidates. Maximal degree in co-relation 116983. Up to 11703 conditions per place. [2024-06-28 01:57:04,851 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 852 selfloop transitions, 332 changer transitions 0/1191 dead transitions. [2024-06-28 01:57:04,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1191 transitions, 24922 flow [2024-06-28 01:57:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2024-06-28 01:57:04,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237154150197628 [2024-06-28 01:57:04,852 INFO L175 Difference]: Start difference. First operand has 211 places, 870 transitions, 17434 flow. Second operand 11 states and 265 transitions. [2024-06-28 01:57:04,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1191 transitions, 24922 flow [2024-06-28 01:57:06,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1191 transitions, 23355 flow, removed 105 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:06,373 INFO L231 Difference]: Finished difference. Result has 218 places, 1050 transitions, 20901 flow [2024-06-28 01:57:06,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16243, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20901, PETRI_PLACES=218, PETRI_TRANSITIONS=1050} [2024-06-28 01:57:06,374 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 166 predicate places. [2024-06-28 01:57:06,374 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 1050 transitions, 20901 flow [2024-06-28 01:57:06,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:06,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:06,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:57:06,375 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:06,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -162670144, now seen corresponding path program 3 times [2024-06-28 01:57:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804020036] [2024-06-28 01:57:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:07,349 INFO L134 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:57:07,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804020036] [2024-06-28 01:57:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804020036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832612346] [2024-06-28 01:57:07,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:07,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:07,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:07,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:57:07,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1050 transitions, 20901 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:57:07,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:07,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:57:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:11,065 INFO L124 PetriNetUnfolderBase]: 9471/14074 cut-off events. [2024-06-28 01:57:11,066 INFO L125 PetriNetUnfolderBase]: For 384312/384780 co-relation queries the response was YES. [2024-06-28 01:57:11,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118518 conditions, 14074 events. 9471/14074 cut-off events. For 384312/384780 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 85956 event pairs, 1950 based on Foata normal form. 20/13539 useless extension candidates. Maximal degree in co-relation 118411. Up to 11756 conditions per place. [2024-06-28 01:57:11,224 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 673 selfloop transitions, 462 changer transitions 0/1166 dead transitions. [2024-06-28 01:57:11,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1166 transitions, 24504 flow [2024-06-28 01:57:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-06-28 01:57:11,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169082125603864 [2024-06-28 01:57:11,226 INFO L175 Difference]: Start difference. First operand has 218 places, 1050 transitions, 20901 flow. Second operand 9 states and 214 transitions. [2024-06-28 01:57:11,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 1166 transitions, 24504 flow [2024-06-28 01:57:12,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1166 transitions, 24167 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:12,805 INFO L231 Difference]: Finished difference. Result has 222 places, 1085 transitions, 22442 flow [2024-06-28 01:57:12,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=20578, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22442, PETRI_PLACES=222, PETRI_TRANSITIONS=1085} [2024-06-28 01:57:12,806 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 170 predicate places. [2024-06-28 01:57:12,807 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1085 transitions, 22442 flow [2024-06-28 01:57:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:57:12,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:12,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:12,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:57:12,807 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash -6535592, now seen corresponding path program 2 times [2024-06-28 01:57:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74876136] [2024-06-28 01:57:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:13,671 INFO L134 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:57:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74876136] [2024-06-28 01:57:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74876136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:13,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:13,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:13,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375401199] [2024-06-28 01:57:13,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:13,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:13,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:13,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:13,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1085 transitions, 22442 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:13,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:13,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:13,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,669 INFO L124 PetriNetUnfolderBase]: 9992/14825 cut-off events. [2024-06-28 01:57:17,670 INFO L125 PetriNetUnfolderBase]: For 377171/377176 co-relation queries the response was YES. [2024-06-28 01:57:17,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121986 conditions, 14825 events. 9992/14825 cut-off events. For 377171/377176 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 90427 event pairs, 2415 based on Foata normal form. 6/14568 useless extension candidates. Maximal degree in co-relation 121876. Up to 13474 conditions per place. [2024-06-28 01:57:17,837 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 1101 selfloop transitions, 113 changer transitions 0/1221 dead transitions. [2024-06-28 01:57:17,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1221 transitions, 26233 flow [2024-06-28 01:57:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2024-06-28 01:57:17,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024154589371981 [2024-06-28 01:57:17,854 INFO L175 Difference]: Start difference. First operand has 222 places, 1085 transitions, 22442 flow. Second operand 9 states and 208 transitions. [2024-06-28 01:57:17,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1221 transitions, 26233 flow [2024-06-28 01:57:19,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 1221 transitions, 25661 flow, removed 83 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:19,351 INFO L231 Difference]: Finished difference. Result has 231 places, 1152 transitions, 23285 flow [2024-06-28 01:57:19,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=21870, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=23285, PETRI_PLACES=231, PETRI_TRANSITIONS=1152} [2024-06-28 01:57:19,352 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 179 predicate places. [2024-06-28 01:57:19,352 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1152 transitions, 23285 flow [2024-06-28 01:57:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:19,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:19,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:19,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:57:19,353 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:19,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -6362612, now seen corresponding path program 3 times [2024-06-28 01:57:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36625995] [2024-06-28 01:57:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:20,292 INFO L134 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:57:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36625995] [2024-06-28 01:57:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36625995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329660105] [2024-06-28 01:57:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:20,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:20,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:20,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1152 transitions, 23285 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:20,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:20,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:24,528 INFO L124 PetriNetUnfolderBase]: 10040/14885 cut-off events. [2024-06-28 01:57:24,528 INFO L125 PetriNetUnfolderBase]: For 389638/389645 co-relation queries the response was YES. [2024-06-28 01:57:24,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125031 conditions, 14885 events. 10040/14885 cut-off events. For 389638/389645 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 90667 event pairs, 2423 based on Foata normal form. 8/14632 useless extension candidates. Maximal degree in co-relation 124914. Up to 13540 conditions per place. [2024-06-28 01:57:24,689 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 1114 selfloop transitions, 122 changer transitions 0/1243 dead transitions. [2024-06-28 01:57:24,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1243 transitions, 26419 flow [2024-06-28 01:57:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-06-28 01:57:24,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2024-06-28 01:57:24,691 INFO L175 Difference]: Start difference. First operand has 231 places, 1152 transitions, 23285 flow. Second operand 11 states and 248 transitions. [2024-06-28 01:57:24,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1243 transitions, 26419 flow [2024-06-28 01:57:26,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1243 transitions, 26117 flow, removed 150 selfloop flow, removed 1 redundant places. [2024-06-28 01:57:26,307 INFO L231 Difference]: Finished difference. Result has 242 places, 1163 transitions, 23481 flow [2024-06-28 01:57:26,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=22997, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23481, PETRI_PLACES=242, PETRI_TRANSITIONS=1163} [2024-06-28 01:57:26,308 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 190 predicate places. [2024-06-28 01:57:26,308 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 1163 transitions, 23481 flow [2024-06-28 01:57:26,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:26,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:26,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:57:26,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:57:26,309 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:26,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -6540366, now seen corresponding path program 4 times [2024-06-28 01:57:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139623597] [2024-06-28 01:57:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:27,184 INFO L134 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:57:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139623597] [2024-06-28 01:57:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139623597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:27,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168048409] [2024-06-28 01:57:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:27,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:27,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-28 01:57:27,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1163 transitions, 23481 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:57:27,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:27,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-28 01:57:27,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:31,518 INFO L124 PetriNetUnfolderBase]: 9807/14447 cut-off events. [2024-06-28 01:57:31,519 INFO L125 PetriNetUnfolderBase]: For 463287/463957 co-relation queries the response was YES. [2024-06-28 01:57:31,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128548 conditions, 14447 events. 9807/14447 cut-off events. For 463287/463957 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 87548 event pairs, 2137 based on Foata normal form. 86/13957 useless extension candidates. Maximal degree in co-relation 128427. Up to 12130 conditions per place. [2024-06-28 01:57:31,676 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 960 selfloop transitions, 237 changer transitions 0/1249 dead transitions. [2024-06-28 01:57:31,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1249 transitions, 26798 flow [2024-06-28 01:57:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-28 01:57:31,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410628019323671 [2024-06-28 01:57:31,680 INFO L175 Difference]: Start difference. First operand has 242 places, 1163 transitions, 23481 flow. Second operand 9 states and 224 transitions. [2024-06-28 01:57:31,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1249 transitions, 26798 flow [2024-06-28 01:57:33,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 1249 transitions, 26416 flow, removed 89 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:33,396 INFO L231 Difference]: Finished difference. Result has 246 places, 1166 transitions, 23784 flow [2024-06-28 01:57:33,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23099, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=23784, PETRI_PLACES=246, PETRI_TRANSITIONS=1166} [2024-06-28 01:57:33,397 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 194 predicate places. [2024-06-28 01:57:33,397 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 1166 transitions, 23784 flow [2024-06-28 01:57:33,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:57:33,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:33,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:33,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:57:33,398 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:33,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -6540242, now seen corresponding path program 4 times [2024-06-28 01:57:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53080375] [2024-06-28 01:57:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:33,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:34,349 INFO L134 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:57:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53080375] [2024-06-28 01:57:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53080375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085050685] [2024-06-28 01:57:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:34,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:34,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:34,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 1166 transitions, 23784 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:34,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:34,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:34,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:38,870 INFO L124 PetriNetUnfolderBase]: 10267/15220 cut-off events. [2024-06-28 01:57:38,870 INFO L125 PetriNetUnfolderBase]: For 433636/433643 co-relation queries the response was YES. [2024-06-28 01:57:38,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130563 conditions, 15220 events. 10267/15220 cut-off events. For 433636/433643 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 92987 event pairs, 2433 based on Foata normal form. 8/14965 useless extension candidates. Maximal degree in co-relation 130439. Up to 13673 conditions per place. [2024-06-28 01:57:39,038 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 1098 selfloop transitions, 153 changer transitions 0/1258 dead transitions. [2024-06-28 01:57:39,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1258 transitions, 27167 flow [2024-06-28 01:57:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-06-28 01:57:39,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048309178743962 [2024-06-28 01:57:39,042 INFO L175 Difference]: Start difference. First operand has 246 places, 1166 transitions, 23784 flow. Second operand 9 states and 209 transitions. [2024-06-28 01:57:39,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 1258 transitions, 27167 flow [2024-06-28 01:57:40,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1258 transitions, 25874 flow, removed 105 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:40,768 INFO L231 Difference]: Finished difference. Result has 247 places, 1188 transitions, 23378 flow [2024-06-28 01:57:40,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=22538, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=23378, PETRI_PLACES=247, PETRI_TRANSITIONS=1188} [2024-06-28 01:57:40,769 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 195 predicate places. [2024-06-28 01:57:40,769 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 1188 transitions, 23378 flow [2024-06-28 01:57:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:40,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:40,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:40,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:57:40,770 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:40,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -6355668, now seen corresponding path program 1 times [2024-06-28 01:57:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276718833] [2024-06-28 01:57:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:41,738 INFO L134 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:57:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276718833] [2024-06-28 01:57:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276718833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935923721] [2024-06-28 01:57:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:41,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:41,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:41,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:41,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:41,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1188 transitions, 23378 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:41,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:41,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:41,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:46,060 INFO L124 PetriNetUnfolderBase]: 10309/15272 cut-off events. [2024-06-28 01:57:46,060 INFO L125 PetriNetUnfolderBase]: For 432319/432326 co-relation queries the response was YES. [2024-06-28 01:57:46,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130228 conditions, 15272 events. 10309/15272 cut-off events. For 432319/432326 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 93329 event pairs, 2490 based on Foata normal form. 8/15018 useless extension candidates. Maximal degree in co-relation 130104. Up to 14092 conditions per place. [2024-06-28 01:57:46,232 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 1172 selfloop transitions, 69 changer transitions 0/1248 dead transitions. [2024-06-28 01:57:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1248 transitions, 26253 flow [2024-06-28 01:57:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-28 01:57:46,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:57:46,234 INFO L175 Difference]: Start difference. First operand has 247 places, 1188 transitions, 23378 flow. Second operand 8 states and 184 transitions. [2024-06-28 01:57:46,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 1248 transitions, 26253 flow [2024-06-28 01:57:47,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 1248 transitions, 25988 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:47,869 INFO L231 Difference]: Finished difference. Result has 250 places, 1190 transitions, 23304 flow [2024-06-28 01:57:47,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23118, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23304, PETRI_PLACES=250, PETRI_TRANSITIONS=1190} [2024-06-28 01:57:47,870 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 198 predicate places. [2024-06-28 01:57:47,870 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 1190 transitions, 23304 flow [2024-06-28 01:57:47,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:47,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:47,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:47,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:57:47,871 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:47,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1068740906, now seen corresponding path program 5 times [2024-06-28 01:57:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:47,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238218939] [2024-06-28 01:57:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:47,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:48,674 INFO L134 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:57:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238218939] [2024-06-28 01:57:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238218939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160759513] [2024-06-28 01:57:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:48,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:48,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:48,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1190 transitions, 23304 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:48,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:48,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:48,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:53,060 INFO L124 PetriNetUnfolderBase]: 10375/15371 cut-off events. [2024-06-28 01:57:53,060 INFO L125 PetriNetUnfolderBase]: For 442083/442090 co-relation queries the response was YES. [2024-06-28 01:57:53,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131744 conditions, 15371 events. 10375/15371 cut-off events. For 442083/442090 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 93757 event pairs, 2325 based on Foata normal form. 8/15114 useless extension candidates. Maximal degree in co-relation 131618. Up to 14018 conditions per place. [2024-06-28 01:57:53,369 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 1176 selfloop transitions, 108 changer transitions 0/1291 dead transitions. [2024-06-28 01:57:53,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1291 transitions, 27101 flow [2024-06-28 01:57:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-28 01:57:53,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-28 01:57:53,376 INFO L175 Difference]: Start difference. First operand has 250 places, 1190 transitions, 23304 flow. Second operand 8 states and 188 transitions. [2024-06-28 01:57:53,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1291 transitions, 27101 flow [2024-06-28 01:57:54,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 1291 transitions, 26961 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:54,978 INFO L231 Difference]: Finished difference. Result has 256 places, 1233 transitions, 24310 flow [2024-06-28 01:57:54,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23164, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1095, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24310, PETRI_PLACES=256, PETRI_TRANSITIONS=1233} [2024-06-28 01:57:54,979 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 204 predicate places. [2024-06-28 01:57:54,979 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 1233 transitions, 24310 flow [2024-06-28 01:57:54,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:54,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:54,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:54,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:57:54,980 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:57:54,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1672481694, now seen corresponding path program 6 times [2024-06-28 01:57:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437126875] [2024-06-28 01:57:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437126875] [2024-06-28 01:57:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437126875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:55,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497646041] [2024-06-28 01:57:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:55,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:56,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-28 01:57:56,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 1233 transitions, 24310 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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:57:56,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:56,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-28 01:57:56,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:00,554 INFO L124 PetriNetUnfolderBase]: 10437/15471 cut-off events. [2024-06-28 01:58:00,555 INFO L125 PetriNetUnfolderBase]: For 472397/472408 co-relation queries the response was YES. [2024-06-28 01:58:00,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134990 conditions, 15471 events. 10437/15471 cut-off events. For 472397/472408 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 94701 event pairs, 2376 based on Foata normal form. 12/15216 useless extension candidates. Maximal degree in co-relation 134860. Up to 13760 conditions per place.