./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix011_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix011_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:22:29,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:22:29,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:22:29,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:22:29,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:22:29,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:22:29,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:22:29,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:22:29,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:22:29,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:22:29,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:22:29,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:22:29,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:22:29,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:22:29,864 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:22:29,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:22:29,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:22:29,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:22:29,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:22:29,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:22:29,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:22:29,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:22:29,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:22:29,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:22:29,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:22:29,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:22:29,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:22:29,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:22:29,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:22:29,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:22:29,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:22:29,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:22:29,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:22:29,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:22:29,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:22:29,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:22:29,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:22:29,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:22:29,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:22:29,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:22:29,871 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:22:29,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:22:29,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:22:29,871 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:22:30,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:22:30,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:22:30,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:22:30,098 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:22:30,099 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:22:30,100 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/mix011_tso.oepc.yml/witness.yml [2024-06-28 01:22:30,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:22:30,253 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:22:30,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-06-28 01:22:31,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:22:31,630 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:22:31,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-06-28 01:22:31,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c31b479/87ddd98e29a94ac1a73e5474f324fd60/FLAG2bfac7870 [2024-06-28 01:22:31,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c31b479/87ddd98e29a94ac1a73e5474f324fd60 [2024-06-28 01:22:31,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:22:31,664 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:22:31,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:22:31,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:22:31,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:22:31,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:22:30" (1/2) ... [2024-06-28 01:22:31,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd01b86 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:22:31, skipping insertion in model container [2024-06-28 01:22:31,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:22:30" (1/2) ... [2024-06-28 01:22:31,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@229afc0a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:22:31, skipping insertion in model container [2024-06-28 01:22:31,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:22:31" (2/2) ... [2024-06-28 01:22:31,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd01b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:31, skipping insertion in model container [2024-06-28 01:22:31,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:22:31" (2/2) ... [2024-06-28 01:22:31,674 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:22:31,776 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:22:31,777 INFO L97 edCorrectnessWitness]: Location invariant before [L840-L840] ((((((((((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2)) [2024-06-28 01:22:31,777 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2)) [2024-06-28 01:22:31,777 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2)) [2024-06-28 01:22:31,778 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:22:31,778 INFO L106 edCorrectnessWitness]: ghost_update [L836-L836] multithreaded = 1; [2024-06-28 01:22:31,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:22:31,969 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/mix011_tso.oepc.i[949,962] [2024-06-28 01:22:32,117 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:22:32,131 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:22:32,156 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/mix011_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:22:32,214 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:22:32,241 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:22:32,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32 WrapperNode [2024-06-28 01:22:32,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:22:32,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:22:32,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:22:32,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:22:32,248 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:22:32" (1/1) ... [2024-06-28 01:22:32,274 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:22:32" (1/1) ... [2024-06-28 01:22:32,296 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-06-28 01:22:32,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:22:32,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:22:32,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:22:32,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:22:32,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,340 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:22:32,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:22:32,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:22:32,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:22:32,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:22:32,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (1/1) ... [2024-06-28 01:22:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:22:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:22:32,407 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:22:32,424 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:22:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:22:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:22:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:22:32,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:22:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:22:32,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:22:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:22:32,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:22:32,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:22:32,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:22:32,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:22:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:22:32,440 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:22:32,578 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:22:32,580 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:22:32,940 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:22:32,940 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:22:33,127 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:22:33,127 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:22:33,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:22:33 BoogieIcfgContainer [2024-06-28 01:22:33,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:22:33,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:22:33,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:22:33,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:22:33,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:22:30" (1/4) ... [2024-06-28 01:22:33,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf41e38 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:22:33, skipping insertion in model container [2024-06-28 01:22:33,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:22:31" (2/4) ... [2024-06-28 01:22:33,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf41e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:22:33, skipping insertion in model container [2024-06-28 01:22:33,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:22:32" (3/4) ... [2024-06-28 01:22:33,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf41e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:22:33, skipping insertion in model container [2024-06-28 01:22:33,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:22:33" (4/4) ... [2024-06-28 01:22:33,137 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2024-06-28 01:22:33,150 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:22:33,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:22:33,151 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:22:33,184 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:22:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-28 01:22:33,228 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-28 01:22:33,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:22:33,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-28 01:22:33,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-28 01:22:33,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-28 01:22:33,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:22:33,246 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;@383a8e67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:22:33,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:22:33,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:22:33,249 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:22:33,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:22:33,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:33,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:22:33,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:33,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash 347919256, now seen corresponding path program 1 times [2024-06-28 01:22:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:33,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439818711] [2024-06-28 01:22:33,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:34,210 INFO L134 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:22:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439818711] [2024-06-28 01:22:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439818711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:22:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019153373] [2024-06-28 01:22:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:34,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:22:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:22:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:22:34,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-28 01:22:34,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:34,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:34,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-28 01:22:34,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:35,151 INFO L124 PetriNetUnfolderBase]: 4271/7027 cut-off events. [2024-06-28 01:22:35,152 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-06-28 01:22:35,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13271 conditions, 7027 events. 4271/7027 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46419 event pairs, 3544 based on Foata normal form. 211/6621 useless extension candidates. Maximal degree in co-relation 13259. Up to 6128 conditions per place. [2024-06-28 01:22:35,211 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 43 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-28 01:22:35,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 233 flow [2024-06-28 01:22:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:22:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:22:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-28 01:22:35,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6870748299319728 [2024-06-28 01:22:35,222 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 101 transitions. [2024-06-28 01:22:35,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 233 flow [2024-06-28 01:22:35,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:22:35,231 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-06-28 01:22:35,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-28 01:22:35,235 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-28 01:22:35,235 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-06-28 01:22:35,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:35,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:35,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:35,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:22:35,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:35,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash -656954829, now seen corresponding path program 1 times [2024-06-28 01:22:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209417458] [2024-06-28 01:22:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:36,011 INFO L134 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:22:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209417458] [2024-06-28 01:22:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209417458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:36,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:36,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:22:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416705504] [2024-06-28 01:22:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:36,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:22:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:36,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:22:36,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:22:36,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:22:36,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:36,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:36,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:22:36,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:36,750 INFO L124 PetriNetUnfolderBase]: 5125/8213 cut-off events. [2024-06-28 01:22:36,750 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2024-06-28 01:22:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 8213 events. 5125/8213 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 53234 event pairs, 3832 based on Foata normal form. 3/7641 useless extension candidates. Maximal degree in co-relation 17281. Up to 7290 conditions per place. [2024-06-28 01:22:36,790 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 56 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2024-06-28 01:22:36,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 333 flow [2024-06-28 01:22:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:22:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:22:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-28 01:22:36,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-06-28 01:22:36,794 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 128 transitions. [2024-06-28 01:22:36,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 333 flow [2024-06-28 01:22:36,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:22:36,797 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-06-28 01:22:36,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-28 01:22:36,798 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-06-28 01:22:36,798 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-06-28 01:22:36,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:36,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:36,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:36,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:22:36,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:36,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1109237829, now seen corresponding path program 1 times [2024-06-28 01:22:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629714898] [2024-06-28 01:22:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:37,457 INFO L134 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:22:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629714898] [2024-06-28 01:22:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629714898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:22:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657701111] [2024-06-28 01:22:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:37,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:22:37,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:37,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:22:37,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:22:37,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:22:37,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:37,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:37,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:22:37,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:38,358 INFO L124 PetriNetUnfolderBase]: 5109/8272 cut-off events. [2024-06-28 01:22:38,358 INFO L125 PetriNetUnfolderBase]: For 2917/2917 co-relation queries the response was YES. [2024-06-28 01:22:38,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18922 conditions, 8272 events. 5109/8272 cut-off events. For 2917/2917 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 54640 event pairs, 2438 based on Foata normal form. 6/7703 useless extension candidates. Maximal degree in co-relation 18908. Up to 7239 conditions per place. [2024-06-28 01:22:38,395 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 68 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-28 01:22:38,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 492 flow [2024-06-28 01:22:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:22:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:22:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-28 01:22:38,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-28 01:22:38,399 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 5 states and 154 transitions. [2024-06-28 01:22:38,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 492 flow [2024-06-28 01:22:38,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 456 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 01:22:38,403 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 302 flow [2024-06-28 01:22:38,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2024-06-28 01:22:38,404 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-28 01:22:38,404 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 302 flow [2024-06-28 01:22:38,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:38,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:38,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:38,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:22:38,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:38,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1106875843, now seen corresponding path program 1 times [2024-06-28 01:22:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478165847] [2024-06-28 01:22:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:22:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:38,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478165847] [2024-06-28 01:22:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478165847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:22:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565645986] [2024-06-28 01:22:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:22:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:22:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:22:38,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2024-06-28 01:22:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:38,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2024-06-28 01:22:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:38,697 INFO L124 PetriNetUnfolderBase]: 1235/2681 cut-off events. [2024-06-28 01:22:38,697 INFO L125 PetriNetUnfolderBase]: For 1264/1400 co-relation queries the response was YES. [2024-06-28 01:22:38,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2681 events. 1235/2681 cut-off events. For 1264/1400 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20878 event pairs, 483 based on Foata normal form. 24/2562 useless extension candidates. Maximal degree in co-relation 5632. Up to 1589 conditions per place. [2024-06-28 01:22:38,710 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 35 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2024-06-28 01:22:38,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 373 flow [2024-06-28 01:22:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:22:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:22:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-28 01:22:38,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-06-28 01:22:38,712 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 302 flow. Second operand 3 states and 113 transitions. [2024-06-28 01:22:38,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 373 flow [2024-06-28 01:22:38,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 365 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 01:22:38,714 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 265 flow [2024-06-28 01:22:38,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-06-28 01:22:38,715 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-06-28 01:22:38,715 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 265 flow [2024-06-28 01:22:38,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:38,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:38,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:38,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:22:38,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:38,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 912540360, now seen corresponding path program 1 times [2024-06-28 01:22:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853581812] [2024-06-28 01:22:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:22:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853581812] [2024-06-28 01:22:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853581812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:22:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951319879] [2024-06-28 01:22:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:22:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:22:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:22:39,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:22:39,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 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:22:39,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:39,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:22:39,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:40,618 INFO L124 PetriNetUnfolderBase]: 4332/7037 cut-off events. [2024-06-28 01:22:40,618 INFO L125 PetriNetUnfolderBase]: For 6222/6222 co-relation queries the response was YES. [2024-06-28 01:22:40,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17306 conditions, 7037 events. 4332/7037 cut-off events. For 6222/6222 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 45203 event pairs, 1768 based on Foata normal form. 6/6807 useless extension candidates. Maximal degree in co-relation 17287. Up to 6106 conditions per place. [2024-06-28 01:22:40,651 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 70 selfloop transitions, 16 changer transitions 1/99 dead transitions. [2024-06-28 01:22:40,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 537 flow [2024-06-28 01:22:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:22:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:22:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-06-28 01:22:40,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-06-28 01:22:40,653 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 265 flow. Second operand 6 states and 174 transitions. [2024-06-28 01:22:40,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 537 flow [2024-06-28 01:22:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:22:40,659 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 307 flow [2024-06-28 01:22:40,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-28 01:22:40,660 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2024-06-28 01:22:40,660 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 307 flow [2024-06-28 01:22:40,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 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:22:40,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:40,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:40,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:22:40,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:40,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1444729862, now seen corresponding path program 1 times [2024-06-28 01:22:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:40,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126627490] [2024-06-28 01:22:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:41,362 INFO L134 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:22:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126627490] [2024-06-28 01:22:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126627490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:22:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874808617] [2024-06-28 01:22:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:41,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:22:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:22:41,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:22:41,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:22:41,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:41,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:41,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:22:41,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:42,350 INFO L124 PetriNetUnfolderBase]: 3603/6017 cut-off events. [2024-06-28 01:22:42,350 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2024-06-28 01:22:42,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15517 conditions, 6017 events. 3603/6017 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38806 event pairs, 1917 based on Foata normal form. 2/5747 useless extension candidates. Maximal degree in co-relation 15496. Up to 5169 conditions per place. [2024-06-28 01:22:42,377 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 68 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2024-06-28 01:22:42,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 555 flow [2024-06-28 01:22:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:22:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:22:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-06-28 01:22:42,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 01:22:42,379 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 307 flow. Second operand 5 states and 128 transitions. [2024-06-28 01:22:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 555 flow [2024-06-28 01:22:42,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 507 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 01:22:42,383 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 352 flow [2024-06-28 01:22:42,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-28 01:22:42,386 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-06-28 01:22:42,386 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 352 flow [2024-06-28 01:22:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:42,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:42,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:22:42,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1836951587, now seen corresponding path program 1 times [2024-06-28 01:22:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781440291] [2024-06-28 01:22:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:43,253 INFO L134 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:22:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781440291] [2024-06-28 01:22:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781440291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:43,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:22:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637484212] [2024-06-28 01:22:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:22:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:22:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:22:43,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:43,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:43,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:43,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:43,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:44,099 INFO L124 PetriNetUnfolderBase]: 4252/7136 cut-off events. [2024-06-28 01:22:44,099 INFO L125 PetriNetUnfolderBase]: For 10525/10525 co-relation queries the response was YES. [2024-06-28 01:22:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19292 conditions, 7136 events. 4252/7136 cut-off events. For 10525/10525 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 46808 event pairs, 2284 based on Foata normal form. 2/6852 useless extension candidates. Maximal degree in co-relation 19268. Up to 6064 conditions per place. [2024-06-28 01:22:44,131 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 78 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-28 01:22:44,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 626 flow [2024-06-28 01:22:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:22:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:22:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-28 01:22:44,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-06-28 01:22:44,133 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 352 flow. Second operand 6 states and 149 transitions. [2024-06-28 01:22:44,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 626 flow [2024-06-28 01:22:44,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 609 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 01:22:44,137 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 393 flow [2024-06-28 01:22:44,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2024-06-28 01:22:44,138 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-06-28 01:22:44,138 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 393 flow [2024-06-28 01:22:44,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:44,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:44,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:44,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:22:44,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:44,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1942784305, now seen corresponding path program 1 times [2024-06-28 01:22:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844211384] [2024-06-28 01:22:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:44,715 INFO L134 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:22:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844211384] [2024-06-28 01:22:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844211384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:44,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:22:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709473571] [2024-06-28 01:22:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:22:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:22:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:22:44,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:44,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:44,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:44,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:44,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:45,666 INFO L124 PetriNetUnfolderBase]: 4880/8058 cut-off events. [2024-06-28 01:22:45,667 INFO L125 PetriNetUnfolderBase]: For 16438/16438 co-relation queries the response was YES. [2024-06-28 01:22:45,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23053 conditions, 8058 events. 4880/8058 cut-off events. For 16438/16438 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 52959 event pairs, 2543 based on Foata normal form. 2/7781 useless extension candidates. Maximal degree in co-relation 23027. Up to 6952 conditions per place. [2024-06-28 01:22:45,707 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 83 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2024-06-28 01:22:45,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 107 transitions, 703 flow [2024-06-28 01:22:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:22:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:22:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-28 01:22:45,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 01:22:45,708 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 393 flow. Second operand 6 states and 150 transitions. [2024-06-28 01:22:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 107 transitions, 703 flow [2024-06-28 01:22:45,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 671 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:22:45,714 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 462 flow [2024-06-28 01:22:45,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-28 01:22:45,715 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2024-06-28 01:22:45,715 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 462 flow [2024-06-28 01:22:45,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:45,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:45,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:22:45,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:45,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -612230731, now seen corresponding path program 2 times [2024-06-28 01:22:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406586359] [2024-06-28 01:22:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:46,325 INFO L134 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:22:46,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:46,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406586359] [2024-06-28 01:22:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406586359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:46,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:22:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878633082] [2024-06-28 01:22:46,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:46,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:22:46,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:22:46,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:22:46,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:46,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 462 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:46,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:46,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:46,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:47,265 INFO L124 PetriNetUnfolderBase]: 4851/7998 cut-off events. [2024-06-28 01:22:47,266 INFO L125 PetriNetUnfolderBase]: For 21291/21311 co-relation queries the response was YES. [2024-06-28 01:22:47,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24337 conditions, 7998 events. 4851/7998 cut-off events. For 21291/21311 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 52438 event pairs, 2410 based on Foata normal form. 18/7760 useless extension candidates. Maximal degree in co-relation 24309. Up to 6874 conditions per place. [2024-06-28 01:22:47,309 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 81 selfloop transitions, 18 changer transitions 0/110 dead transitions. [2024-06-28 01:22:47,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 766 flow [2024-06-28 01:22:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:22:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:22:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-28 01:22:47,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-06-28 01:22:47,312 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 462 flow. Second operand 6 states and 151 transitions. [2024-06-28 01:22:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 766 flow [2024-06-28 01:22:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 110 transitions, 733 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:22:47,320 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 507 flow [2024-06-28 01:22:47,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2024-06-28 01:22:47,322 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-06-28 01:22:47,322 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 507 flow [2024-06-28 01:22:47,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:22:47,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:47,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:47,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:22:47,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:47,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -612221803, now seen corresponding path program 1 times [2024-06-28 01:22:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512326727] [2024-06-28 01:22:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:48,110 INFO L134 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:22:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512326727] [2024-06-28 01:22:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512326727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822258553] [2024-06-28 01:22:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:48,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:48,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:48,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 507 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:48,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:48,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:48,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:49,158 INFO L124 PetriNetUnfolderBase]: 4284/7249 cut-off events. [2024-06-28 01:22:49,158 INFO L125 PetriNetUnfolderBase]: For 22812/22812 co-relation queries the response was YES. [2024-06-28 01:22:49,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22988 conditions, 7249 events. 4284/7249 cut-off events. For 22812/22812 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 48109 event pairs, 2165 based on Foata normal form. 2/6991 useless extension candidates. Maximal degree in co-relation 22959. Up to 6089 conditions per place. [2024-06-28 01:22:49,209 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 97 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2024-06-28 01:22:49,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 865 flow [2024-06-28 01:22:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:22:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:22:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-28 01:22:49,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-28 01:22:49,211 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 507 flow. Second operand 7 states and 174 transitions. [2024-06-28 01:22:49,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 865 flow [2024-06-28 01:22:49,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 813 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:22:49,224 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 527 flow [2024-06-28 01:22:49,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-06-28 01:22:49,224 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-06-28 01:22:49,224 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 527 flow [2024-06-28 01:22:49,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:49,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:49,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:49,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:22:49,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:49,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash -96891253, now seen corresponding path program 1 times [2024-06-28 01:22:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:49,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569718891] [2024-06-28 01:22:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:50,025 INFO L134 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:22:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569718891] [2024-06-28 01:22:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569718891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:50,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:50,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681141356] [2024-06-28 01:22:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:50,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:50,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:50,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:50,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:50,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:51,292 INFO L124 PetriNetUnfolderBase]: 4923/8152 cut-off events. [2024-06-28 01:22:51,293 INFO L125 PetriNetUnfolderBase]: For 32476/32484 co-relation queries the response was YES. [2024-06-28 01:22:51,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27222 conditions, 8152 events. 4923/8152 cut-off events. For 32476/32484 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 53704 event pairs, 2117 based on Foata normal form. 12/7882 useless extension candidates. Maximal degree in co-relation 27192. Up to 6951 conditions per place. [2024-06-28 01:22:51,347 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 92 selfloop transitions, 29 changer transitions 0/132 dead transitions. [2024-06-28 01:22:51,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 926 flow [2024-06-28 01:22:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:22:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:22:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-28 01:22:51,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-28 01:22:51,349 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 527 flow. Second operand 7 states and 181 transitions. [2024-06-28 01:22:51,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 926 flow [2024-06-28 01:22:51,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 880 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 01:22:51,362 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 628 flow [2024-06-28 01:22:51,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-06-28 01:22:51,362 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2024-06-28 01:22:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 628 flow [2024-06-28 01:22:51,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:51,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:51,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:22:51,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:51,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash -257208738, now seen corresponding path program 1 times [2024-06-28 01:22:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581521250] [2024-06-28 01:22:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:52,351 INFO L134 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:22:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581521250] [2024-06-28 01:22:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581521250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498885075] [2024-06-28 01:22:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:52,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:52,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:52,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:52,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:22:52,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:52,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:52,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:22:52,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:53,406 INFO L124 PetriNetUnfolderBase]: 5217/8467 cut-off events. [2024-06-28 01:22:53,407 INFO L125 PetriNetUnfolderBase]: For 39150/39150 co-relation queries the response was YES. [2024-06-28 01:22:53,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30282 conditions, 8467 events. 5217/8467 cut-off events. For 39150/39150 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 54252 event pairs, 2263 based on Foata normal form. 2/8211 useless extension candidates. Maximal degree in co-relation 30250. Up to 7385 conditions per place. [2024-06-28 01:22:53,457 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 109 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2024-06-28 01:22:53,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 1020 flow [2024-06-28 01:22:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:22:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:22:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-28 01:22:53,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-06-28 01:22:53,459 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 628 flow. Second operand 7 states and 169 transitions. [2024-06-28 01:22:53,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 1020 flow [2024-06-28 01:22:53,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 134 transitions, 955 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-28 01:22:53,480 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 643 flow [2024-06-28 01:22:53,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2024-06-28 01:22:53,482 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2024-06-28 01:22:53,482 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 643 flow [2024-06-28 01:22:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:53,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:53,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:53,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:22:53,482 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:53,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -96770353, now seen corresponding path program 2 times [2024-06-28 01:22:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454183385] [2024-06-28 01:22:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:22:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454183385] [2024-06-28 01:22:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454183385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294261628] [2024-06-28 01:22:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:54,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:54,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:54,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 643 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:54,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:54,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:54,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:55,472 INFO L124 PetriNetUnfolderBase]: 5033/8270 cut-off events. [2024-06-28 01:22:55,472 INFO L125 PetriNetUnfolderBase]: For 48028/48076 co-relation queries the response was YES. [2024-06-28 01:22:55,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31021 conditions, 8270 events. 5033/8270 cut-off events. For 48028/48076 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 54096 event pairs, 2040 based on Foata normal form. 12/7994 useless extension candidates. Maximal degree in co-relation 30988. Up to 7017 conditions per place. [2024-06-28 01:22:55,520 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 99 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-28 01:22:55,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 148 transitions, 1198 flow [2024-06-28 01:22:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:22:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:22:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-28 01:22:55,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-28 01:22:55,523 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 643 flow. Second operand 7 states and 182 transitions. [2024-06-28 01:22:55,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 148 transitions, 1198 flow [2024-06-28 01:22:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 148 transitions, 1141 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 01:22:55,541 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 829 flow [2024-06-28 01:22:55,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=829, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2024-06-28 01:22:55,542 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-28 01:22:55,543 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 829 flow [2024-06-28 01:22:55,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:55,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:55,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:55,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:22:55,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:55,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 406601447, now seen corresponding path program 3 times [2024-06-28 01:22:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477338845] [2024-06-28 01:22:55,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:22:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477338845] [2024-06-28 01:22:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477338845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96251139] [2024-06-28 01:22:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:56,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:56,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:22:56,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 829 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:56,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:56,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:22:56,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:57,392 INFO L124 PetriNetUnfolderBase]: 5010/8311 cut-off events. [2024-06-28 01:22:57,392 INFO L125 PetriNetUnfolderBase]: For 57631/57664 co-relation queries the response was YES. [2024-06-28 01:22:57,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32784 conditions, 8311 events. 5010/8311 cut-off events. For 57631/57664 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 54954 event pairs, 1915 based on Foata normal form. 13/8047 useless extension candidates. Maximal degree in co-relation 32749. Up to 6927 conditions per place. [2024-06-28 01:22:57,446 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 103 selfloop transitions, 53 changer transitions 0/168 dead transitions. [2024-06-28 01:22:57,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 168 transitions, 1552 flow [2024-06-28 01:22:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:22:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:22:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-28 01:22:57,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-28 01:22:57,448 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 829 flow. Second operand 8 states and 198 transitions. [2024-06-28 01:22:57,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 168 transitions, 1552 flow [2024-06-28 01:22:57,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 168 transitions, 1456 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-28 01:22:57,479 INFO L231 Difference]: Finished difference. Result has 98 places, 130 transitions, 1134 flow [2024-06-28 01:22:57,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1134, PETRI_PLACES=98, PETRI_TRANSITIONS=130} [2024-06-28 01:22:57,479 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-28 01:22:57,479 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 130 transitions, 1134 flow [2024-06-28 01:22:57,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:57,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:57,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:57,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:22:57,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:57,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash -252538278, now seen corresponding path program 2 times [2024-06-28 01:22:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384489546] [2024-06-28 01:22:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:22:58,337 INFO L134 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:22:58,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:22:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384489546] [2024-06-28 01:22:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384489546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:22:58,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:22:58,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:22:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932256342] [2024-06-28 01:22:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:22:58,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:22:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:22:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:22:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:22:58,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:22:58,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 130 transitions, 1134 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:58,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:22:58,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:22:58,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:22:59,371 INFO L124 PetriNetUnfolderBase]: 5315/8626 cut-off events. [2024-06-28 01:22:59,371 INFO L125 PetriNetUnfolderBase]: For 68560/68582 co-relation queries the response was YES. [2024-06-28 01:22:59,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36202 conditions, 8626 events. 5315/8626 cut-off events. For 68560/68582 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 55380 event pairs, 2152 based on Foata normal form. 20/8386 useless extension candidates. Maximal degree in co-relation 36163. Up to 7426 conditions per place. [2024-06-28 01:22:59,429 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 133 selfloop transitions, 35 changer transitions 0/177 dead transitions. [2024-06-28 01:22:59,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 177 transitions, 1783 flow [2024-06-28 01:22:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:22:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:22:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-28 01:22:59,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-28 01:22:59,430 INFO L175 Difference]: Start difference. First operand has 98 places, 130 transitions, 1134 flow. Second operand 7 states and 174 transitions. [2024-06-28 01:22:59,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 177 transitions, 1783 flow [2024-06-28 01:22:59,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 177 transitions, 1683 flow, removed 49 selfloop flow, removed 1 redundant places. [2024-06-28 01:22:59,466 INFO L231 Difference]: Finished difference. Result has 104 places, 136 transitions, 1221 flow [2024-06-28 01:22:59,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1221, PETRI_PLACES=104, PETRI_TRANSITIONS=136} [2024-06-28 01:22:59,467 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2024-06-28 01:22:59,467 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 136 transitions, 1221 flow [2024-06-28 01:22:59,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:22:59,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:22:59,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:22:59,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:22:59,467 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:22:59,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:22:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1799015392, now seen corresponding path program 3 times [2024-06-28 01:22:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:22:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928614379] [2024-06-28 01:22:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:22:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:22:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:00,186 INFO L134 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:23:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928614379] [2024-06-28 01:23:00,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928614379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:00,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:00,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:23:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899980563] [2024-06-28 01:23:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:23:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:23:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:23:00,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:00,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 136 transitions, 1221 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:00,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:00,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:00,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:01,268 INFO L124 PetriNetUnfolderBase]: 5310/8619 cut-off events. [2024-06-28 01:23:01,269 INFO L125 PetriNetUnfolderBase]: For 76557/76579 co-relation queries the response was YES. [2024-06-28 01:23:01,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37260 conditions, 8619 events. 5310/8619 cut-off events. For 76557/76579 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 55356 event pairs, 2151 based on Foata normal form. 20/8379 useless extension candidates. Maximal degree in co-relation 37218. Up to 7421 conditions per place. [2024-06-28 01:23:01,328 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 128 selfloop transitions, 37 changer transitions 0/174 dead transitions. [2024-06-28 01:23:01,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 1696 flow [2024-06-28 01:23:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:23:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:23:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-28 01:23:01,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-06-28 01:23:01,329 INFO L175 Difference]: Start difference. First operand has 104 places, 136 transitions, 1221 flow. Second operand 7 states and 171 transitions. [2024-06-28 01:23:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 174 transitions, 1696 flow [2024-06-28 01:23:01,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 174 transitions, 1606 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-28 01:23:01,388 INFO L231 Difference]: Finished difference. Result has 108 places, 136 transitions, 1213 flow [2024-06-28 01:23:01,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1213, PETRI_PLACES=108, PETRI_TRANSITIONS=136} [2024-06-28 01:23:01,388 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 53 predicate places. [2024-06-28 01:23:01,389 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 136 transitions, 1213 flow [2024-06-28 01:23:01,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:01,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:01,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:23:01,389 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:01,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash -720392281, now seen corresponding path program 1 times [2024-06-28 01:23:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269791330] [2024-06-28 01:23:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:01,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:23:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269791330] [2024-06-28 01:23:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269791330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:23:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129984232] [2024-06-28 01:23:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:23:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:23:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:23:01,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:01,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 136 transitions, 1213 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:01,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:01,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:03,001 INFO L124 PetriNetUnfolderBase]: 5827/9508 cut-off events. [2024-06-28 01:23:03,001 INFO L125 PetriNetUnfolderBase]: For 88523/88589 co-relation queries the response was YES. [2024-06-28 01:23:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40916 conditions, 9508 events. 5827/9508 cut-off events. For 88523/88589 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 62133 event pairs, 2500 based on Foata normal form. 7/9207 useless extension candidates. Maximal degree in co-relation 40872. Up to 8275 conditions per place. [2024-06-28 01:23:03,079 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 128 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2024-06-28 01:23:03,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 155 transitions, 1574 flow [2024-06-28 01:23:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:23:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:23:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-06-28 01:23:03,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-28 01:23:03,081 INFO L175 Difference]: Start difference. First operand has 108 places, 136 transitions, 1213 flow. Second operand 5 states and 118 transitions. [2024-06-28 01:23:03,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 155 transitions, 1574 flow [2024-06-28 01:23:03,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 155 transitions, 1486 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:23:03,142 INFO L231 Difference]: Finished difference. Result has 107 places, 139 transitions, 1191 flow [2024-06-28 01:23:03,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1191, PETRI_PLACES=107, PETRI_TRANSITIONS=139} [2024-06-28 01:23:03,143 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places. [2024-06-28 01:23:03,143 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 139 transitions, 1191 flow [2024-06-28 01:23:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:03,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:03,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:23:03,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:03,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash 612618936, now seen corresponding path program 1 times [2024-06-28 01:23:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814491733] [2024-06-28 01:23:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:04,186 INFO L134 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:23:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814491733] [2024-06-28 01:23:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814491733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304602337] [2024-06-28 01:23:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:04,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:23:04,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 139 transitions, 1191 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:04,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:04,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:23:04,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:05,560 INFO L124 PetriNetUnfolderBase]: 5471/9001 cut-off events. [2024-06-28 01:23:05,560 INFO L125 PetriNetUnfolderBase]: For 92737/92797 co-relation queries the response was YES. [2024-06-28 01:23:05,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40295 conditions, 9001 events. 5471/9001 cut-off events. For 92737/92797 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 60052 event pairs, 2190 based on Foata normal form. 10/8656 useless extension candidates. Maximal degree in co-relation 40250. Up to 7622 conditions per place. [2024-06-28 01:23:05,618 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 131 selfloop transitions, 32 changer transitions 0/178 dead transitions. [2024-06-28 01:23:05,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 178 transitions, 1683 flow [2024-06-28 01:23:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:23:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:23:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-28 01:23:05,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-06-28 01:23:05,620 INFO L175 Difference]: Start difference. First operand has 107 places, 139 transitions, 1191 flow. Second operand 7 states and 180 transitions. [2024-06-28 01:23:05,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 178 transitions, 1683 flow [2024-06-28 01:23:05,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 178 transitions, 1567 flow, removed 47 selfloop flow, removed 3 redundant places. [2024-06-28 01:23:05,676 INFO L231 Difference]: Finished difference. Result has 111 places, 142 transitions, 1217 flow [2024-06-28 01:23:05,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1217, PETRI_PLACES=111, PETRI_TRANSITIONS=142} [2024-06-28 01:23:05,677 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2024-06-28 01:23:05,677 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 142 transitions, 1217 flow [2024-06-28 01:23:05,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:05,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:05,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:05,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:23:05,678 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:05,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 612710262, now seen corresponding path program 1 times [2024-06-28 01:23:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269547486] [2024-06-28 01:23:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:06,535 INFO L134 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:23:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269547486] [2024-06-28 01:23:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269547486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:06,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524191837] [2024-06-28 01:23:06,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:06,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:06,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:06,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:06,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 142 transitions, 1217 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:06,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:06,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:06,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:07,855 INFO L124 PetriNetUnfolderBase]: 5796/9361 cut-off events. [2024-06-28 01:23:07,855 INFO L125 PetriNetUnfolderBase]: For 98202/98202 co-relation queries the response was YES. [2024-06-28 01:23:07,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42233 conditions, 9361 events. 5796/9361 cut-off events. For 98202/98202 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 60896 event pairs, 2313 based on Foata normal form. 4/9032 useless extension candidates. Maximal degree in co-relation 42187. Up to 8057 conditions per place. [2024-06-28 01:23:07,937 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 146 selfloop transitions, 34 changer transitions 0/190 dead transitions. [2024-06-28 01:23:07,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 190 transitions, 1769 flow [2024-06-28 01:23:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-28 01:23:07,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076530612244898 [2024-06-28 01:23:07,939 INFO L175 Difference]: Start difference. First operand has 111 places, 142 transitions, 1217 flow. Second operand 8 states and 199 transitions. [2024-06-28 01:23:07,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 190 transitions, 1769 flow [2024-06-28 01:23:08,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 190 transitions, 1699 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:08,008 INFO L231 Difference]: Finished difference. Result has 114 places, 146 transitions, 1290 flow [2024-06-28 01:23:08,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1290, PETRI_PLACES=114, PETRI_TRANSITIONS=146} [2024-06-28 01:23:08,009 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places. [2024-06-28 01:23:08,009 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 146 transitions, 1290 flow [2024-06-28 01:23:08,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:08,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:08,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:08,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:23:08,011 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:08,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash 616464920, now seen corresponding path program 1 times [2024-06-28 01:23:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888518233] [2024-06-28 01:23:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:08,817 INFO L134 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:23:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888518233] [2024-06-28 01:23:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888518233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42795777] [2024-06-28 01:23:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:08,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:08,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:08,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:08,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 146 transitions, 1290 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:08,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:08,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:10,291 INFO L124 PetriNetUnfolderBase]: 5824/9409 cut-off events. [2024-06-28 01:23:10,291 INFO L125 PetriNetUnfolderBase]: For 110151/110151 co-relation queries the response was YES. [2024-06-28 01:23:10,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44112 conditions, 9409 events. 5824/9409 cut-off events. For 110151/110151 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 61142 event pairs, 2272 based on Foata normal form. 2/9079 useless extension candidates. Maximal degree in co-relation 44065. Up to 8155 conditions per place. [2024-06-28 01:23:10,366 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 162 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2024-06-28 01:23:10,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 1868 flow [2024-06-28 01:23:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-28 01:23:10,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923469387755102 [2024-06-28 01:23:10,368 INFO L175 Difference]: Start difference. First operand has 114 places, 146 transitions, 1290 flow. Second operand 8 states and 193 transitions. [2024-06-28 01:23:10,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 1868 flow [2024-06-28 01:23:10,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 194 transitions, 1755 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-28 01:23:10,441 INFO L231 Difference]: Finished difference. Result has 116 places, 149 transitions, 1287 flow [2024-06-28 01:23:10,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1287, PETRI_PLACES=116, PETRI_TRANSITIONS=149} [2024-06-28 01:23:10,442 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2024-06-28 01:23:10,442 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 149 transitions, 1287 flow [2024-06-28 01:23:10,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:10,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:10,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:10,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:23:10,442 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:10,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash 616464672, now seen corresponding path program 2 times [2024-06-28 01:23:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:10,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171980018] [2024-06-28 01:23:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:11,328 INFO L134 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:23:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:11,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171980018] [2024-06-28 01:23:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171980018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:11,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:11,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:11,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881374768] [2024-06-28 01:23:11,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:11,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:11,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:11,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:11,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:11,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 149 transitions, 1287 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:11,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:11,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:11,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:12,637 INFO L124 PetriNetUnfolderBase]: 6185/9926 cut-off events. [2024-06-28 01:23:12,637 INFO L125 PetriNetUnfolderBase]: For 126199/126205 co-relation queries the response was YES. [2024-06-28 01:23:12,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48120 conditions, 9926 events. 6185/9926 cut-off events. For 126199/126205 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 63933 event pairs, 2290 based on Foata normal form. 8/9595 useless extension candidates. Maximal degree in co-relation 48072. Up to 8389 conditions per place. [2024-06-28 01:23:12,727 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 171 selfloop transitions, 68 changer transitions 0/249 dead transitions. [2024-06-28 01:23:12,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 249 transitions, 2617 flow [2024-06-28 01:23:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-28 01:23:12,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943310657596372 [2024-06-28 01:23:12,729 INFO L175 Difference]: Start difference. First operand has 116 places, 149 transitions, 1287 flow. Second operand 9 states and 218 transitions. [2024-06-28 01:23:12,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 249 transitions, 2617 flow [2024-06-28 01:23:12,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 249 transitions, 2518 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 01:23:12,827 INFO L231 Difference]: Finished difference. Result has 122 places, 195 transitions, 2008 flow [2024-06-28 01:23:12,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2008, PETRI_PLACES=122, PETRI_TRANSITIONS=195} [2024-06-28 01:23:12,827 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 67 predicate places. [2024-06-28 01:23:12,827 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 195 transitions, 2008 flow [2024-06-28 01:23:12,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:12,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:12,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:12,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:23:12,828 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:12,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1230389984, now seen corresponding path program 3 times [2024-06-28 01:23:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006701855] [2024-06-28 01:23:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:23:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006701855] [2024-06-28 01:23:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006701855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563241761] [2024-06-28 01:23:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:13,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:13,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 195 transitions, 2008 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:13,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:13,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:13,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:15,024 INFO L124 PetriNetUnfolderBase]: 6601/10476 cut-off events. [2024-06-28 01:23:15,025 INFO L125 PetriNetUnfolderBase]: For 153971/153975 co-relation queries the response was YES. [2024-06-28 01:23:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54775 conditions, 10476 events. 6601/10476 cut-off events. For 153971/153975 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 66437 event pairs, 2430 based on Foata normal form. 8/10147 useless extension candidates. Maximal degree in co-relation 54723. Up to 8755 conditions per place. [2024-06-28 01:23:15,135 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 187 selfloop transitions, 116 changer transitions 0/313 dead transitions. [2024-06-28 01:23:15,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 313 transitions, 3774 flow [2024-06-28 01:23:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-28 01:23:15,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-06-28 01:23:15,137 INFO L175 Difference]: Start difference. First operand has 122 places, 195 transitions, 2008 flow. Second operand 9 states and 227 transitions. [2024-06-28 01:23:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 313 transitions, 3774 flow [2024-06-28 01:23:15,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 313 transitions, 3577 flow, removed 74 selfloop flow, removed 3 redundant places. [2024-06-28 01:23:15,344 INFO L231 Difference]: Finished difference. Result has 131 places, 255 transitions, 3105 flow [2024-06-28 01:23:15,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3105, PETRI_PLACES=131, PETRI_TRANSITIONS=255} [2024-06-28 01:23:15,345 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2024-06-28 01:23:15,345 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 255 transitions, 3105 flow [2024-06-28 01:23:15,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:15,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:15,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:15,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:23:15,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:15,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1191229236, now seen corresponding path program 4 times [2024-06-28 01:23:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:15,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903550319] [2024-06-28 01:23:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:16,140 INFO L134 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:23:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903550319] [2024-06-28 01:23:16,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903550319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:16,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109592224] [2024-06-28 01:23:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:16,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:16,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:16,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 255 transitions, 3105 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:16,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:16,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:17,626 INFO L124 PetriNetUnfolderBase]: 6648/10529 cut-off events. [2024-06-28 01:23:17,626 INFO L125 PetriNetUnfolderBase]: For 174234/174244 co-relation queries the response was YES. [2024-06-28 01:23:17,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58418 conditions, 10529 events. 6648/10529 cut-off events. For 174234/174244 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 66752 event pairs, 2460 based on Foata normal form. 10/10196 useless extension candidates. Maximal degree in co-relation 58361. Up to 8811 conditions per place. [2024-06-28 01:23:17,722 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 193 selfloop transitions, 118 changer transitions 0/321 dead transitions. [2024-06-28 01:23:17,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 321 transitions, 4218 flow [2024-06-28 01:23:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-28 01:23:17,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-06-28 01:23:17,724 INFO L175 Difference]: Start difference. First operand has 131 places, 255 transitions, 3105 flow. Second operand 9 states and 228 transitions. [2024-06-28 01:23:17,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 321 transitions, 4218 flow [2024-06-28 01:23:17,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 321 transitions, 4123 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-06-28 01:23:17,950 INFO L231 Difference]: Finished difference. Result has 139 places, 265 transitions, 3503 flow [2024-06-28 01:23:17,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3020, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3503, PETRI_PLACES=139, PETRI_TRANSITIONS=265} [2024-06-28 01:23:17,950 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2024-06-28 01:23:17,950 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 265 transitions, 3503 flow [2024-06-28 01:23:17,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:17,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:17,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:17,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:23:17,951 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:17,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 616458162, now seen corresponding path program 5 times [2024-06-28 01:23:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670342518] [2024-06-28 01:23:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:18,848 INFO L134 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:23:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670342518] [2024-06-28 01:23:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670342518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135021970] [2024-06-28 01:23:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:18,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:18,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:18,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 265 transitions, 3503 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:18,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:18,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:20,496 INFO L124 PetriNetUnfolderBase]: 6617/10482 cut-off events. [2024-06-28 01:23:20,496 INFO L125 PetriNetUnfolderBase]: For 181445/181457 co-relation queries the response was YES. [2024-06-28 01:23:20,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59263 conditions, 10482 events. 6617/10482 cut-off events. For 181445/181457 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 66514 event pairs, 2276 based on Foata normal form. 8/10154 useless extension candidates. Maximal degree in co-relation 59203. Up to 8772 conditions per place. [2024-06-28 01:23:20,635 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 194 selfloop transitions, 118 changer transitions 0/322 dead transitions. [2024-06-28 01:23:20,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 322 transitions, 4535 flow [2024-06-28 01:23:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-28 01:23:20,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2024-06-28 01:23:20,637 INFO L175 Difference]: Start difference. First operand has 139 places, 265 transitions, 3503 flow. Second operand 9 states and 219 transitions. [2024-06-28 01:23:20,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 322 transitions, 4535 flow [2024-06-28 01:23:20,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 322 transitions, 4283 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:20,983 INFO L231 Difference]: Finished difference. Result has 144 places, 271 transitions, 3660 flow [2024-06-28 01:23:20,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3251, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3660, PETRI_PLACES=144, PETRI_TRANSITIONS=271} [2024-06-28 01:23:20,984 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2024-06-28 01:23:20,984 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 271 transitions, 3660 flow [2024-06-28 01:23:20,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:20,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:20,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:20,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:23:20,985 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:20,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1849448314, now seen corresponding path program 2 times [2024-06-28 01:23:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834967552] [2024-06-28 01:23:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:21,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:23:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:21,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834967552] [2024-06-28 01:23:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834967552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:21,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968063398] [2024-06-28 01:23:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:21,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:21,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:21,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:21,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 271 transitions, 3660 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:21,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:21,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:21,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:23,433 INFO L124 PetriNetUnfolderBase]: 6648/10551 cut-off events. [2024-06-28 01:23:23,433 INFO L125 PetriNetUnfolderBase]: For 190395/190457 co-relation queries the response was YES. [2024-06-28 01:23:23,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60180 conditions, 10551 events. 6648/10551 cut-off events. For 190395/190457 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 67277 event pairs, 2182 based on Foata normal form. 46/10264 useless extension candidates. Maximal degree in co-relation 60118. Up to 9037 conditions per place. [2024-06-28 01:23:23,538 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 263 selfloop transitions, 65 changer transitions 0/338 dead transitions. [2024-06-28 01:23:23,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 338 transitions, 5033 flow [2024-06-28 01:23:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-28 01:23:23,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-06-28 01:23:23,540 INFO L175 Difference]: Start difference. First operand has 144 places, 271 transitions, 3660 flow. Second operand 8 states and 201 transitions. [2024-06-28 01:23:23,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 338 transitions, 5033 flow [2024-06-28 01:23:23,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 338 transitions, 4829 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:23,812 INFO L231 Difference]: Finished difference. Result has 147 places, 280 transitions, 3804 flow [2024-06-28 01:23:23,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3462, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3804, PETRI_PLACES=147, PETRI_TRANSITIONS=280} [2024-06-28 01:23:23,813 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-06-28 01:23:23,813 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 280 transitions, 3804 flow [2024-06-28 01:23:23,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:23,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:23,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:23,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:23:23,814 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:23,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash 65098654, now seen corresponding path program 6 times [2024-06-28 01:23:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691140824] [2024-06-28 01:23:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:24,550 INFO L134 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:23:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691140824] [2024-06-28 01:23:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691140824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68985480] [2024-06-28 01:23:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:24,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:24,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:24,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 280 transitions, 3804 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:24,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:24,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:24,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:26,214 INFO L124 PetriNetUnfolderBase]: 6668/10625 cut-off events. [2024-06-28 01:23:26,214 INFO L125 PetriNetUnfolderBase]: For 205260/205268 co-relation queries the response was YES. [2024-06-28 01:23:26,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61489 conditions, 10625 events. 6668/10625 cut-off events. For 205260/205268 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 68086 event pairs, 2100 based on Foata normal form. 8/10297 useless extension candidates. Maximal degree in co-relation 61426. Up to 8413 conditions per place. [2024-06-28 01:23:26,325 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 152 selfloop transitions, 184 changer transitions 0/346 dead transitions. [2024-06-28 01:23:26,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 346 transitions, 5111 flow [2024-06-28 01:23:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-28 01:23:26,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-06-28 01:23:26,327 INFO L175 Difference]: Start difference. First operand has 147 places, 280 transitions, 3804 flow. Second operand 8 states and 201 transitions. [2024-06-28 01:23:26,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 346 transitions, 5111 flow [2024-06-28 01:23:26,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 346 transitions, 5013 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-28 01:23:26,666 INFO L231 Difference]: Finished difference. Result has 154 places, 301 transitions, 4559 flow [2024-06-28 01:23:26,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4559, PETRI_PLACES=154, PETRI_TRANSITIONS=301} [2024-06-28 01:23:26,667 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 99 predicate places. [2024-06-28 01:23:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 301 transitions, 4559 flow [2024-06-28 01:23:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:26,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:26,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:26,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:23:26,668 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:26,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1849744984, now seen corresponding path program 3 times [2024-06-28 01:23:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108992027] [2024-06-28 01:23:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:27,377 INFO L134 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:23:27,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108992027] [2024-06-28 01:23:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108992027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:27,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655434712] [2024-06-28 01:23:27,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:27,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:27,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:27,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 301 transitions, 4559 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:28,949 INFO L124 PetriNetUnfolderBase]: 6692/10623 cut-off events. [2024-06-28 01:23:28,949 INFO L125 PetriNetUnfolderBase]: For 229279/229325 co-relation queries the response was YES. [2024-06-28 01:23:29,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65209 conditions, 10623 events. 6692/10623 cut-off events. For 229279/229325 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 67774 event pairs, 2188 based on Foata normal form. 36/10333 useless extension candidates. Maximal degree in co-relation 65142. Up to 9098 conditions per place. [2024-06-28 01:23:29,055 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 271 selfloop transitions, 77 changer transitions 0/358 dead transitions. [2024-06-28 01:23:29,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 358 transitions, 5727 flow [2024-06-28 01:23:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-28 01:23:29,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-28 01:23:29,057 INFO L175 Difference]: Start difference. First operand has 154 places, 301 transitions, 4559 flow. Second operand 8 states and 198 transitions. [2024-06-28 01:23:29,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 358 transitions, 5727 flow [2024-06-28 01:23:29,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 358 transitions, 5368 flow, removed 115 selfloop flow, removed 3 redundant places. [2024-06-28 01:23:29,552 INFO L231 Difference]: Finished difference. Result has 159 places, 301 transitions, 4385 flow [2024-06-28 01:23:29,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4223, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4385, PETRI_PLACES=159, PETRI_TRANSITIONS=301} [2024-06-28 01:23:29,553 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 104 predicate places. [2024-06-28 01:23:29,553 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 301 transitions, 4385 flow [2024-06-28 01:23:29,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:29,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:29,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:29,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:23:29,554 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:29,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash -280249346, now seen corresponding path program 7 times [2024-06-28 01:23:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809935790] [2024-06-28 01:23:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:23:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809935790] [2024-06-28 01:23:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809935790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:30,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33213079] [2024-06-28 01:23:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:30,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:30,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 301 transitions, 4385 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:30,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:30,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:30,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:32,170 INFO L124 PetriNetUnfolderBase]: 6705/10677 cut-off events. [2024-06-28 01:23:32,170 INFO L125 PetriNetUnfolderBase]: For 234193/234201 co-relation queries the response was YES. [2024-06-28 01:23:32,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65664 conditions, 10677 events. 6705/10677 cut-off events. For 234193/234201 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 68330 event pairs, 2165 based on Foata normal form. 8/10349 useless extension candidates. Maximal degree in co-relation 65595. Up to 8442 conditions per place. [2024-06-28 01:23:32,291 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 170 selfloop transitions, 176 changer transitions 0/356 dead transitions. [2024-06-28 01:23:32,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 356 transitions, 5639 flow [2024-06-28 01:23:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-28 01:23:32,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-06-28 01:23:32,293 INFO L175 Difference]: Start difference. First operand has 159 places, 301 transitions, 4385 flow. Second operand 8 states and 206 transitions. [2024-06-28 01:23:32,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 356 transitions, 5639 flow [2024-06-28 01:23:32,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 356 transitions, 5473 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 01:23:32,647 INFO L231 Difference]: Finished difference. Result has 162 places, 310 transitions, 4790 flow [2024-06-28 01:23:32,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4221, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4790, PETRI_PLACES=162, PETRI_TRANSITIONS=310} [2024-06-28 01:23:32,648 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 107 predicate places. [2024-06-28 01:23:32,648 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 310 transitions, 4790 flow [2024-06-28 01:23:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:32,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:32,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:23:32,649 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:32,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -280249098, now seen corresponding path program 4 times [2024-06-28 01:23:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486019533] [2024-06-28 01:23:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:33,442 INFO L134 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:23:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486019533] [2024-06-28 01:23:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486019533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585998889] [2024-06-28 01:23:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:33,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:33,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 310 transitions, 4790 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:33,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:34,991 INFO L124 PetriNetUnfolderBase]: 6729/10681 cut-off events. [2024-06-28 01:23:34,992 INFO L125 PetriNetUnfolderBase]: For 248309/248355 co-relation queries the response was YES. [2024-06-28 01:23:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67077 conditions, 10681 events. 6729/10681 cut-off events. For 248309/248355 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 68175 event pairs, 2201 based on Foata normal form. 36/10388 useless extension candidates. Maximal degree in co-relation 67006. Up to 9151 conditions per place. [2024-06-28 01:23:35,100 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 289 selfloop transitions, 68 changer transitions 0/367 dead transitions. [2024-06-28 01:23:35,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 367 transitions, 5907 flow [2024-06-28 01:23:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-28 01:23:35,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-28 01:23:35,101 INFO L175 Difference]: Start difference. First operand has 162 places, 310 transitions, 4790 flow. Second operand 8 states and 198 transitions. [2024-06-28 01:23:35,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 367 transitions, 5907 flow [2024-06-28 01:23:35,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 367 transitions, 5553 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-28 01:23:35,497 INFO L231 Difference]: Finished difference. Result has 166 places, 310 transitions, 4598 flow [2024-06-28 01:23:35,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4453, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4598, PETRI_PLACES=166, PETRI_TRANSITIONS=310} [2024-06-28 01:23:35,498 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2024-06-28 01:23:35,498 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 310 transitions, 4598 flow [2024-06-28 01:23:35,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:35,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:35,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:35,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:23:35,498 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:35,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 56817934, now seen corresponding path program 8 times [2024-06-28 01:23:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117040280] [2024-06-28 01:23:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:36,276 INFO L134 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:23:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117040280] [2024-06-28 01:23:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117040280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:23:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043904898] [2024-06-28 01:23:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:23:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:23:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:23:36,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:36,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 310 transitions, 4598 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:36,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:36,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:36,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:37,938 INFO L124 PetriNetUnfolderBase]: 6690/10656 cut-off events. [2024-06-28 01:23:37,938 INFO L125 PetriNetUnfolderBase]: For 251846/251854 co-relation queries the response was YES. [2024-06-28 01:23:38,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65947 conditions, 10656 events. 6690/10656 cut-off events. For 251846/251854 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 68190 event pairs, 2165 based on Foata normal form. 8/10328 useless extension candidates. Maximal degree in co-relation 65875. Up to 8427 conditions per place. [2024-06-28 01:23:38,077 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 165 selfloop transitions, 181 changer transitions 0/356 dead transitions. [2024-06-28 01:23:38,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 356 transitions, 5621 flow [2024-06-28 01:23:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:23:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:23:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-28 01:23:38,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-06-28 01:23:38,079 INFO L175 Difference]: Start difference. First operand has 166 places, 310 transitions, 4598 flow. Second operand 8 states and 202 transitions. [2024-06-28 01:23:38,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 356 transitions, 5621 flow [2024-06-28 01:23:38,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 356 transitions, 5327 flow, removed 54 selfloop flow, removed 8 redundant places. [2024-06-28 01:23:38,447 INFO L231 Difference]: Finished difference. Result has 166 places, 313 transitions, 4740 flow [2024-06-28 01:23:38,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4740, PETRI_PLACES=166, PETRI_TRANSITIONS=313} [2024-06-28 01:23:38,453 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2024-06-28 01:23:38,454 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 313 transitions, 4740 flow [2024-06-28 01:23:38,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:38,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:38,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:38,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:23:38,454 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:38,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 65406484, now seen corresponding path program 1 times [2024-06-28 01:23:38,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:38,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737854256] [2024-06-28 01:23:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:38,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:39,486 INFO L134 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:23:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737854256] [2024-06-28 01:23:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737854256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:23:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186257638] [2024-06-28 01:23:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:39,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:23:39,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:23:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:23:39,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:39,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 313 transitions, 4740 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:39,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:39,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:39,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:41,350 INFO L124 PetriNetUnfolderBase]: 6658/10815 cut-off events. [2024-06-28 01:23:41,351 INFO L125 PetriNetUnfolderBase]: For 268275/268284 co-relation queries the response was YES. [2024-06-28 01:23:41,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66636 conditions, 10815 events. 6658/10815 cut-off events. For 268275/268284 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 70922 event pairs, 2983 based on Foata normal form. 2/10426 useless extension candidates. Maximal degree in co-relation 66563. Up to 9294 conditions per place. [2024-06-28 01:23:41,476 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 322 selfloop transitions, 41 changer transitions 0/373 dead transitions. [2024-06-28 01:23:41,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 373 transitions, 5891 flow [2024-06-28 01:23:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-28 01:23:41,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48072562358276644 [2024-06-28 01:23:41,482 INFO L175 Difference]: Start difference. First operand has 166 places, 313 transitions, 4740 flow. Second operand 9 states and 212 transitions. [2024-06-28 01:23:41,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 373 transitions, 5891 flow [2024-06-28 01:23:41,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 373 transitions, 5547 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:41,845 INFO L231 Difference]: Finished difference. Result has 172 places, 330 transitions, 4793 flow [2024-06-28 01:23:41,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4793, PETRI_PLACES=172, PETRI_TRANSITIONS=330} [2024-06-28 01:23:41,846 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 117 predicate places. [2024-06-28 01:23:41,846 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 330 transitions, 4793 flow [2024-06-28 01:23:41,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:41,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:41,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:23:41,847 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:41,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:41,847 INFO L85 PathProgramCache]: Analyzing trace with hash -857322238, now seen corresponding path program 1 times [2024-06-28 01:23:41,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:41,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778786318] [2024-06-28 01:23:41,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:42,492 INFO L134 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:23:42,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778786318] [2024-06-28 01:23:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778786318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:42,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:23:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267605356] [2024-06-28 01:23:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:23:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:23:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:23:42,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:42,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 330 transitions, 4793 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:42,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:42,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:42,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:44,423 INFO L124 PetriNetUnfolderBase]: 6882/11062 cut-off events. [2024-06-28 01:23:44,423 INFO L125 PetriNetUnfolderBase]: For 281649/281842 co-relation queries the response was YES. [2024-06-28 01:23:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68432 conditions, 11062 events. 6882/11062 cut-off events. For 281649/281842 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 71437 event pairs, 3335 based on Foata normal form. 47/10789 useless extension candidates. Maximal degree in co-relation 68356. Up to 9542 conditions per place. [2024-06-28 01:23:44,632 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 300 selfloop transitions, 18 changer transitions 0/355 dead transitions. [2024-06-28 01:23:44,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 355 transitions, 5565 flow [2024-06-28 01:23:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:23:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:23:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-28 01:23:44,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:23:44,634 INFO L175 Difference]: Start difference. First operand has 172 places, 330 transitions, 4793 flow. Second operand 6 states and 140 transitions. [2024-06-28 01:23:44,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 355 transitions, 5565 flow [2024-06-28 01:23:45,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 355 transitions, 4996 flow, removed 138 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:45,151 INFO L231 Difference]: Finished difference. Result has 173 places, 333 transitions, 4304 flow [2024-06-28 01:23:45,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4224, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4304, PETRI_PLACES=173, PETRI_TRANSITIONS=333} [2024-06-28 01:23:45,152 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 118 predicate places. [2024-06-28 01:23:45,152 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 333 transitions, 4304 flow [2024-06-28 01:23:45,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:45,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:45,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:45,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:23:45,153 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:45,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2146228282, now seen corresponding path program 1 times [2024-06-28 01:23:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:45,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459024490] [2024-06-28 01:23:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:46,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:23:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459024490] [2024-06-28 01:23:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459024490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:46,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:46,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:23:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321253619] [2024-06-28 01:23:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:46,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:23:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:23:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:23:46,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:23:46,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 333 transitions, 4304 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:46,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:46,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:23:46,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:48,118 INFO L124 PetriNetUnfolderBase]: 7206/11545 cut-off events. [2024-06-28 01:23:48,118 INFO L125 PetriNetUnfolderBase]: For 308633/308809 co-relation queries the response was YES. [2024-06-28 01:23:48,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73650 conditions, 11545 events. 7206/11545 cut-off events. For 308633/308809 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 75755 event pairs, 2404 based on Foata normal form. 57/11218 useless extension candidates. Maximal degree in co-relation 73572. Up to 9705 conditions per place. [2024-06-28 01:23:48,245 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 295 selfloop transitions, 73 changer transitions 0/408 dead transitions. [2024-06-28 01:23:48,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 408 transitions, 5525 flow [2024-06-28 01:23:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-28 01:23:48,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-28 01:23:48,247 INFO L175 Difference]: Start difference. First operand has 173 places, 333 transitions, 4304 flow. Second operand 9 states and 230 transitions. [2024-06-28 01:23:48,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 408 transitions, 5525 flow [2024-06-28 01:23:48,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 408 transitions, 5467 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-28 01:23:48,644 INFO L231 Difference]: Finished difference. Result has 180 places, 357 transitions, 4772 flow [2024-06-28 01:23:48,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4246, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4772, PETRI_PLACES=180, PETRI_TRANSITIONS=357} [2024-06-28 01:23:48,644 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2024-06-28 01:23:48,644 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 357 transitions, 4772 flow [2024-06-28 01:23:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:48,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:48,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:23:48,645 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:48,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash 317351070, now seen corresponding path program 2 times [2024-06-28 01:23:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259433616] [2024-06-28 01:23:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:49,709 INFO L134 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:23:49,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:49,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259433616] [2024-06-28 01:23:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259433616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:49,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:23:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886528723] [2024-06-28 01:23:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:49,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:23:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:49,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:23:49,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:23:49,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:23:49,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 357 transitions, 4772 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:49,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:49,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:23:49,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:51,938 INFO L124 PetriNetUnfolderBase]: 7439/11857 cut-off events. [2024-06-28 01:23:51,938 INFO L125 PetriNetUnfolderBase]: For 342288/342555 co-relation queries the response was YES. [2024-06-28 01:23:52,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78278 conditions, 11857 events. 7439/11857 cut-off events. For 342288/342555 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 77517 event pairs, 2549 based on Foata normal form. 60/11520 useless extension candidates. Maximal degree in co-relation 78197. Up to 9964 conditions per place. [2024-06-28 01:23:52,126 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 306 selfloop transitions, 93 changer transitions 0/439 dead transitions. [2024-06-28 01:23:52,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 439 transitions, 6270 flow [2024-06-28 01:23:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:23:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:23:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:23:52,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:23:52,127 INFO L175 Difference]: Start difference. First operand has 180 places, 357 transitions, 4772 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:23:52,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 439 transitions, 6270 flow [2024-06-28 01:23:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 439 transitions, 5956 flow, removed 78 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:52,657 INFO L231 Difference]: Finished difference. Result has 186 places, 385 transitions, 5210 flow [2024-06-28 01:23:52,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4568, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5210, PETRI_PLACES=186, PETRI_TRANSITIONS=385} [2024-06-28 01:23:52,658 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 131 predicate places. [2024-06-28 01:23:52,658 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 385 transitions, 5210 flow [2024-06-28 01:23:52,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:52,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:52,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:52,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:23:52,659 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:52,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 483987495, now seen corresponding path program 1 times [2024-06-28 01:23:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413769923] [2024-06-28 01:23:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:53,675 INFO L134 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:23:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413769923] [2024-06-28 01:23:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413769923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:53,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:53,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:23:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071982734] [2024-06-28 01:23:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:53,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:23:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:23:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:23:53,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:53,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 385 transitions, 5210 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:53,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:53,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:53,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:23:56,167 INFO L124 PetriNetUnfolderBase]: 7946/12524 cut-off events. [2024-06-28 01:23:56,168 INFO L125 PetriNetUnfolderBase]: For 364828/364868 co-relation queries the response was YES. [2024-06-28 01:23:56,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84095 conditions, 12524 events. 7946/12524 cut-off events. For 364828/364868 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 80849 event pairs, 2489 based on Foata normal form. 39/12194 useless extension candidates. Maximal degree in co-relation 84011. Up to 10793 conditions per place. [2024-06-28 01:23:56,371 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 352 selfloop transitions, 104 changer transitions 0/467 dead transitions. [2024-06-28 01:23:56,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 467 transitions, 6792 flow [2024-06-28 01:23:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:23:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:23:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-06-28 01:23:56,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2024-06-28 01:23:56,373 INFO L175 Difference]: Start difference. First operand has 186 places, 385 transitions, 5210 flow. Second operand 10 states and 246 transitions. [2024-06-28 01:23:56,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 467 transitions, 6792 flow [2024-06-28 01:23:56,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 467 transitions, 6546 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-28 01:23:56,942 INFO L231 Difference]: Finished difference. Result has 194 places, 412 transitions, 5716 flow [2024-06-28 01:23:56,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4970, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5716, PETRI_PLACES=194, PETRI_TRANSITIONS=412} [2024-06-28 01:23:56,943 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 139 predicate places. [2024-06-28 01:23:56,943 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 412 transitions, 5716 flow [2024-06-28 01:23:56,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:56,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:23:56,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:23:56,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:23:56,943 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:23:56,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:23:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 362104251, now seen corresponding path program 1 times [2024-06-28 01:23:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:23:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784516141] [2024-06-28 01:23:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:23:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:23:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:23:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:23:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:23:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784516141] [2024-06-28 01:23:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784516141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:23:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:23:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:23:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930196049] [2024-06-28 01:23:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:23:57,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:23:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:23:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:23:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:23:58,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:23:58,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 412 transitions, 5716 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:23:58,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:23:58,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:23:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:00,467 INFO L124 PetriNetUnfolderBase]: 8129/12714 cut-off events. [2024-06-28 01:24:00,467 INFO L125 PetriNetUnfolderBase]: For 400091/400150 co-relation queries the response was YES. [2024-06-28 01:24:00,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88330 conditions, 12714 events. 8129/12714 cut-off events. For 400091/400150 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 81574 event pairs, 3065 based on Foata normal form. 26/12343 useless extension candidates. Maximal degree in co-relation 88242. Up to 11043 conditions per place. [2024-06-28 01:24:00,625 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 344 selfloop transitions, 145 changer transitions 0/500 dead transitions. [2024-06-28 01:24:00,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 500 transitions, 7699 flow [2024-06-28 01:24:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-28 01:24:00,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:24:00,627 INFO L175 Difference]: Start difference. First operand has 194 places, 412 transitions, 5716 flow. Second operand 9 states and 224 transitions. [2024-06-28 01:24:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 500 transitions, 7699 flow [2024-06-28 01:24:01,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 500 transitions, 7389 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-28 01:24:01,217 INFO L231 Difference]: Finished difference. Result has 201 places, 454 transitions, 6677 flow [2024-06-28 01:24:01,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5454, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6677, PETRI_PLACES=201, PETRI_TRANSITIONS=454} [2024-06-28 01:24:01,218 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 146 predicate places. [2024-06-28 01:24:01,218 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 454 transitions, 6677 flow [2024-06-28 01:24:01,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:01,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:01,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:01,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:24:01,218 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:01,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1027461934, now seen corresponding path program 3 times [2024-06-28 01:24:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774984795] [2024-06-28 01:24:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:02,189 INFO L134 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:24:02,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774984795] [2024-06-28 01:24:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774984795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:02,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:02,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298495123] [2024-06-28 01:24:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:02,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:02,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:24:02,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 454 transitions, 6677 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:02,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:02,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:24:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:04,733 INFO L124 PetriNetUnfolderBase]: 8016/12618 cut-off events. [2024-06-28 01:24:04,733 INFO L125 PetriNetUnfolderBase]: For 435413/435967 co-relation queries the response was YES. [2024-06-28 01:24:04,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89122 conditions, 12618 events. 8016/12618 cut-off events. For 435413/435967 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 81949 event pairs, 2525 based on Foata normal form. 195/12377 useless extension candidates. Maximal degree in co-relation 89030. Up to 10557 conditions per place. [2024-06-28 01:24:04,876 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 344 selfloop transitions, 142 changer transitions 0/530 dead transitions. [2024-06-28 01:24:04,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 530 transitions, 8123 flow [2024-06-28 01:24:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-28 01:24:04,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-06-28 01:24:04,878 INFO L175 Difference]: Start difference. First operand has 201 places, 454 transitions, 6677 flow. Second operand 9 states and 227 transitions. [2024-06-28 01:24:04,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 530 transitions, 8123 flow [2024-06-28 01:24:05,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 530 transitions, 7901 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-28 01:24:05,421 INFO L231 Difference]: Finished difference. Result has 209 places, 484 transitions, 7152 flow [2024-06-28 01:24:05,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6455, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7152, PETRI_PLACES=209, PETRI_TRANSITIONS=484} [2024-06-28 01:24:05,421 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 154 predicate places. [2024-06-28 01:24:05,421 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 484 transitions, 7152 flow [2024-06-28 01:24:05,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:05,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:05,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:05,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:24:05,422 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:05,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:05,422 INFO L85 PathProgramCache]: Analyzing trace with hash 362680696, now seen corresponding path program 4 times [2024-06-28 01:24:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3702196] [2024-06-28 01:24:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:06,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:06,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3702196] [2024-06-28 01:24:06,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3702196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:06,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:06,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:06,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44690063] [2024-06-28 01:24:06,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:06,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:06,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:24:06,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 484 transitions, 7152 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:06,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:06,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:24:06,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:09,019 INFO L124 PetriNetUnfolderBase]: 8002/12633 cut-off events. [2024-06-28 01:24:09,025 INFO L125 PetriNetUnfolderBase]: For 457053/457551 co-relation queries the response was YES. [2024-06-28 01:24:09,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91691 conditions, 12633 events. 8002/12633 cut-off events. For 457053/457551 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 82136 event pairs, 2867 based on Foata normal form. 277/12496 useless extension candidates. Maximal degree in co-relation 91596. Up to 10724 conditions per place. [2024-06-28 01:24:09,194 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 357 selfloop transitions, 132 changer transitions 0/533 dead transitions. [2024-06-28 01:24:09,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 533 transitions, 8442 flow [2024-06-28 01:24:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:24:09,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:24:09,196 INFO L175 Difference]: Start difference. First operand has 209 places, 484 transitions, 7152 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:24:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 533 transitions, 8442 flow [2024-06-28 01:24:09,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 533 transitions, 8245 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-28 01:24:09,883 INFO L231 Difference]: Finished difference. Result has 214 places, 487 transitions, 7336 flow [2024-06-28 01:24:09,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6955, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7336, PETRI_PLACES=214, PETRI_TRANSITIONS=487} [2024-06-28 01:24:09,884 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 159 predicate places. [2024-06-28 01:24:09,884 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 487 transitions, 7336 flow [2024-06-28 01:24:09,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:09,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:09,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:09,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:24:09,885 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:09,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:09,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1337615889, now seen corresponding path program 2 times [2024-06-28 01:24:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184841727] [2024-06-28 01:24:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:11,023 INFO L134 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:24:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184841727] [2024-06-28 01:24:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184841727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:24:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458576143] [2024-06-28 01:24:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:11,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:24:11,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:24:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:24:11,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:24:11,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 487 transitions, 7336 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:11,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:11,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:24:11,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:13,783 INFO L124 PetriNetUnfolderBase]: 8404/13205 cut-off events. [2024-06-28 01:24:13,784 INFO L125 PetriNetUnfolderBase]: For 465734/465773 co-relation queries the response was YES. [2024-06-28 01:24:13,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96892 conditions, 13205 events. 8404/13205 cut-off events. For 465734/465773 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 85010 event pairs, 2690 based on Foata normal form. 43/12887 useless extension candidates. Maximal degree in co-relation 96796. Up to 11334 conditions per place. [2024-06-28 01:24:13,940 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 409 selfloop transitions, 150 changer transitions 0/570 dead transitions. [2024-06-28 01:24:13,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 570 transitions, 9266 flow [2024-06-28 01:24:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:24:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:24:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2024-06-28 01:24:13,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040816326530613 [2024-06-28 01:24:13,956 INFO L175 Difference]: Start difference. First operand has 214 places, 487 transitions, 7336 flow. Second operand 10 states and 247 transitions. [2024-06-28 01:24:13,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 570 transitions, 9266 flow [2024-06-28 01:24:14,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 570 transitions, 8895 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-06-28 01:24:14,744 INFO L231 Difference]: Finished difference. Result has 220 places, 515 transitions, 7934 flow [2024-06-28 01:24:14,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6985, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7934, PETRI_PLACES=220, PETRI_TRANSITIONS=515} [2024-06-28 01:24:14,745 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 165 predicate places. [2024-06-28 01:24:14,745 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 515 transitions, 7934 flow [2024-06-28 01:24:14,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:14,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:14,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:14,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:24:14,746 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:14,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1333665534, now seen corresponding path program 5 times [2024-06-28 01:24:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500749090] [2024-06-28 01:24:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500749090] [2024-06-28 01:24:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500749090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597080729] [2024-06-28 01:24:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:15,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:16,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:24:16,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 515 transitions, 7934 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:16,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:16,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:24:16,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:18,629 INFO L124 PetriNetUnfolderBase]: 8159/12903 cut-off events. [2024-06-28 01:24:18,629 INFO L125 PetriNetUnfolderBase]: For 503464/503992 co-relation queries the response was YES. [2024-06-28 01:24:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97617 conditions, 12903 events. 8159/12903 cut-off events. For 503464/503992 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 83990 event pairs, 2594 based on Foata normal form. 260/12747 useless extension candidates. Maximal degree in co-relation 97517. Up to 10854 conditions per place. [2024-06-28 01:24:18,800 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 396 selfloop transitions, 144 changer transitions 0/586 dead transitions. [2024-06-28 01:24:18,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 586 transitions, 9728 flow [2024-06-28 01:24:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:24:18,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:24:18,802 INFO L175 Difference]: Start difference. First operand has 220 places, 515 transitions, 7934 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:24:18,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 586 transitions, 9728 flow [2024-06-28 01:24:19,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 586 transitions, 9469 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-28 01:24:19,574 INFO L231 Difference]: Finished difference. Result has 226 places, 537 transitions, 8553 flow [2024-06-28 01:24:19,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7675, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8553, PETRI_PLACES=226, PETRI_TRANSITIONS=537} [2024-06-28 01:24:19,575 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 171 predicate places. [2024-06-28 01:24:19,575 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 537 transitions, 8553 flow [2024-06-28 01:24:19,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:19,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:19,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:19,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:24:19,575 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:19,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash -122805345, now seen corresponding path program 2 times [2024-06-28 01:24:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708376638] [2024-06-28 01:24:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:20,661 INFO L134 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:24:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708376638] [2024-06-28 01:24:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708376638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695592183] [2024-06-28 01:24:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:20,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:20,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:20,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:24:20,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 537 transitions, 8553 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:20,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:20,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:24:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:23,513 INFO L124 PetriNetUnfolderBase]: 8532/13357 cut-off events. [2024-06-28 01:24:23,513 INFO L125 PetriNetUnfolderBase]: For 516309/516342 co-relation queries the response was YES. [2024-06-28 01:24:23,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101770 conditions, 13357 events. 8532/13357 cut-off events. For 516309/516342 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 85572 event pairs, 2701 based on Foata normal form. 36/13026 useless extension candidates. Maximal degree in co-relation 101668. Up to 11500 conditions per place. [2024-06-28 01:24:23,790 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 421 selfloop transitions, 170 changer transitions 0/602 dead transitions. [2024-06-28 01:24:23,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 602 transitions, 10315 flow [2024-06-28 01:24:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-28 01:24:23,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:24:23,792 INFO L175 Difference]: Start difference. First operand has 226 places, 537 transitions, 8553 flow. Second operand 9 states and 224 transitions. [2024-06-28 01:24:23,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 602 transitions, 10315 flow [2024-06-28 01:24:24,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 602 transitions, 9856 flow, removed 129 selfloop flow, removed 5 redundant places. [2024-06-28 01:24:24,834 INFO L231 Difference]: Finished difference. Result has 230 places, 553 transitions, 8858 flow [2024-06-28 01:24:24,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8162, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8858, PETRI_PLACES=230, PETRI_TRANSITIONS=553} [2024-06-28 01:24:24,835 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 175 predicate places. [2024-06-28 01:24:24,835 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 553 transitions, 8858 flow [2024-06-28 01:24:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:24,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:24,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:24,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:24:24,836 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash -6476450, now seen corresponding path program 6 times [2024-06-28 01:24:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890221718] [2024-06-28 01:24:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890221718] [2024-06-28 01:24:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890221718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479048905] [2024-06-28 01:24:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:26,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:24:26,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 553 transitions, 8858 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:26,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:26,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:24:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:28,832 INFO L124 PetriNetUnfolderBase]: 8201/12988 cut-off events. [2024-06-28 01:24:28,832 INFO L125 PetriNetUnfolderBase]: For 538807/539243 co-relation queries the response was YES. [2024-06-28 01:24:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99839 conditions, 12988 events. 8201/12988 cut-off events. For 538807/539243 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 84661 event pairs, 2535 based on Foata normal form. 177/12773 useless extension candidates. Maximal degree in co-relation 99736. Up to 10804 conditions per place. [2024-06-28 01:24:29,026 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 370 selfloop transitions, 185 changer transitions 0/605 dead transitions. [2024-06-28 01:24:29,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 605 transitions, 10331 flow [2024-06-28 01:24:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:24:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:24:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:24:29,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:24:29,028 INFO L175 Difference]: Start difference. First operand has 230 places, 553 transitions, 8858 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:24:29,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 605 transitions, 10331 flow [2024-06-28 01:24:29,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 605 transitions, 10015 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:24:29,970 INFO L231 Difference]: Finished difference. Result has 232 places, 556 transitions, 9043 flow [2024-06-28 01:24:29,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8542, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9043, PETRI_PLACES=232, PETRI_TRANSITIONS=556} [2024-06-28 01:24:29,971 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 177 predicate places. [2024-06-28 01:24:29,972 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 556 transitions, 9043 flow [2024-06-28 01:24:29,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:29,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:29,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:24:29,972 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:29,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1726598142, now seen corresponding path program 1 times [2024-06-28 01:24:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349754720] [2024-06-28 01:24:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:30,817 INFO L134 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:24:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349754720] [2024-06-28 01:24:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349754720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787440038] [2024-06-28 01:24:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:30,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:30,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:24:30,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 556 transitions, 9043 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:30,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:30,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:24:30,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:34,373 INFO L124 PetriNetUnfolderBase]: 8921/14015 cut-off events. [2024-06-28 01:24:34,374 INFO L125 PetriNetUnfolderBase]: For 598567/598586 co-relation queries the response was YES. [2024-06-28 01:24:34,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109420 conditions, 14015 events. 8921/14015 cut-off events. For 598567/598586 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 90728 event pairs, 2548 based on Foata normal form. 23/13652 useless extension candidates. Maximal degree in co-relation 109316. Up to 11137 conditions per place. [2024-06-28 01:24:34,621 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 373 selfloop transitions, 251 changer transitions 0/635 dead transitions. [2024-06-28 01:24:34,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 635 transitions, 11375 flow [2024-06-28 01:24:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:24:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:24:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2024-06-28 01:24:34,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-28 01:24:34,622 INFO L175 Difference]: Start difference. First operand has 232 places, 556 transitions, 9043 flow. Second operand 10 states and 258 transitions. [2024-06-28 01:24:34,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 635 transitions, 11375 flow [2024-06-28 01:24:35,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 635 transitions, 10884 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-28 01:24:35,690 INFO L231 Difference]: Finished difference. Result has 237 places, 572 transitions, 9689 flow [2024-06-28 01:24:35,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8552, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9689, PETRI_PLACES=237, PETRI_TRANSITIONS=572} [2024-06-28 01:24:35,692 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 182 predicate places. [2024-06-28 01:24:35,692 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 572 transitions, 9689 flow [2024-06-28 01:24:35,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:35,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:35,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:35,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:24:35,692 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:35,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1726396332, now seen corresponding path program 2 times [2024-06-28 01:24:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320501877] [2024-06-28 01:24:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:24:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320501877] [2024-06-28 01:24:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320501877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:36,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:36,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701264257] [2024-06-28 01:24:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:36,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:36,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:36,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:24:36,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 572 transitions, 9689 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:36,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:36,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:24:36,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:39,980 INFO L124 PetriNetUnfolderBase]: 8963/14081 cut-off events. [2024-06-28 01:24:39,980 INFO L125 PetriNetUnfolderBase]: For 639983/640002 co-relation queries the response was YES. [2024-06-28 01:24:40,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114166 conditions, 14081 events. 8963/14081 cut-off events. For 639983/640002 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 91388 event pairs, 2454 based on Foata normal form. 23/13718 useless extension candidates. Maximal degree in co-relation 114059. Up to 11157 conditions per place. [2024-06-28 01:24:40,177 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 360 selfloop transitions, 268 changer transitions 0/639 dead transitions. [2024-06-28 01:24:40,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 639 transitions, 11748 flow [2024-06-28 01:24:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:24:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:24:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-06-28 01:24:40,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244897959183673 [2024-06-28 01:24:40,178 INFO L175 Difference]: Start difference. First operand has 237 places, 572 transitions, 9689 flow. Second operand 10 states and 257 transitions. [2024-06-28 01:24:40,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 639 transitions, 11748 flow [2024-06-28 01:24:41,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 639 transitions, 11463 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-28 01:24:41,495 INFO L231 Difference]: Finished difference. Result has 242 places, 576 transitions, 10095 flow [2024-06-28 01:24:41,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9416, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10095, PETRI_PLACES=242, PETRI_TRANSITIONS=576} [2024-06-28 01:24:41,496 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 187 predicate places. [2024-06-28 01:24:41,496 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 576 transitions, 10095 flow [2024-06-28 01:24:41,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:41,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:41,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:41,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:24:41,497 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:41,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1726388892, now seen corresponding path program 3 times [2024-06-28 01:24:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:41,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119355725] [2024-06-28 01:24:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:42,361 INFO L134 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:24:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119355725] [2024-06-28 01:24:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119355725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:42,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577807619] [2024-06-28 01:24:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:42,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:42,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:24:42,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 576 transitions, 10095 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:42,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:42,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:24:42,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:45,601 INFO L124 PetriNetUnfolderBase]: 8949/14063 cut-off events. [2024-06-28 01:24:45,601 INFO L125 PetriNetUnfolderBase]: For 648003/648022 co-relation queries the response was YES. [2024-06-28 01:24:45,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114632 conditions, 14063 events. 8949/14063 cut-off events. For 648003/648022 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 91350 event pairs, 2449 based on Foata normal form. 27/13704 useless extension candidates. Maximal degree in co-relation 114523. Up to 11153 conditions per place. [2024-06-28 01:24:45,776 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 345 selfloop transitions, 281 changer transitions 0/637 dead transitions. [2024-06-28 01:24:45,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 637 transitions, 11841 flow [2024-06-28 01:24:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:24:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:24:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-06-28 01:24:45,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 01:24:45,782 INFO L175 Difference]: Start difference. First operand has 242 places, 576 transitions, 10095 flow. Second operand 10 states and 254 transitions. [2024-06-28 01:24:45,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 637 transitions, 11841 flow [2024-06-28 01:24:47,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 637 transitions, 11168 flow, removed 112 selfloop flow, removed 7 redundant places. [2024-06-28 01:24:47,183 INFO L231 Difference]: Finished difference. Result has 245 places, 576 transitions, 9995 flow [2024-06-28 01:24:47,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9422, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9995, PETRI_PLACES=245, PETRI_TRANSITIONS=576} [2024-06-28 01:24:47,184 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 190 predicate places. [2024-06-28 01:24:47,184 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 576 transitions, 9995 flow [2024-06-28 01:24:47,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:47,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:47,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:47,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:24:47,185 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:47,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -647775422, now seen corresponding path program 1 times [2024-06-28 01:24:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752885909] [2024-06-28 01:24:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:47,725 INFO L134 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:24:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752885909] [2024-06-28 01:24:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752885909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:47,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:47,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:24:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381962454] [2024-06-28 01:24:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:47,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:24:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:24:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:24:47,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-06-28 01:24:47,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 576 transitions, 9995 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:47,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:47,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-06-28 01:24:47,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:49,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L785-->L788: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][117], [639#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 519#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 521#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 517#(and (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 534#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 296#true, 9#L788true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 545#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 546#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 10#L851true, Black: 303#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 609#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 568#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 319#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 584#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 330#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 599#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 347#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 610#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 625#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 644#true, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 279#true, Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 384#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 48#L760true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 510#true, Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 423#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 451#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 466#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 467#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 351#true, Black: 469#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 482#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 339#true, Black: 480#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 200#true, 414#true, Black: 241#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 503#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 505#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 502#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 499#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-28 01:24:49,667 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-28 01:24:49,667 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:24:49,667 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:24:49,667 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 01:24:49,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][407], [32#L805true, Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 519#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 521#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 517#(and (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 534#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 296#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 545#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 546#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 10#L851true, Black: 303#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 568#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 319#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 584#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 330#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 603#true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 599#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 347#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 610#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 609#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 631#true, Black: 357#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 644#true, 13#L785true, 279#true, Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 384#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 48#L760true, Black: 410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 510#true, Black: 423#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 451#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 466#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 351#true, Black: 467#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 482#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 339#true, Black: 480#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 200#true, 414#true, Black: 241#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 503#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 505#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 502#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 499#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-28 01:24:49,838 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 01:24:49,838 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:24:49,838 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:24:49,838 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 01:24:49,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([360] L760-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][223], [Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 519#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 521#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 517#(and (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 534#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 296#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 545#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 546#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 10#L851true, Black: 303#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 568#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 319#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 584#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 330#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 603#true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 599#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 347#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 610#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 609#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 631#true, Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 644#true, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, 279#true, Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 384#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 510#true, Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 423#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 43#L763true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 451#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 466#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 351#true, Black: 467#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 482#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 339#true, Black: 480#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 200#true, 414#true, Black: 241#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 503#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 505#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 502#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 499#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-28 01:24:49,863 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,863 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,864 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,864 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([322] L851-->L867: Formula: (let ((.cse1 (= (mod v_~x$r_buff1_thd0~0_90 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_86 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~x$w_buff0_used~0_150 256) 0)) (.cse5 (and (= (mod v_~x$w_buff1_used~0_137 256) 0) .cse8)) (.cse6 (and .cse1 .cse8))) (let ((.cse10 (or .cse12 .cse5 .cse6)) (.cse11 (and (not .cse12) .cse9))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_136 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_42 256) 0))) (.cse7 (ite .cse10 v_~x~0_103 (ite .cse11 v_~x$w_buff0~0_78 v_~x$w_buff1~0_67)))) (and (= v_~x$mem_tmp~0_40 v_~x~0_103) (= v_~x$r_buff1_thd0~0_89 (ite .cse0 v_~x$r_buff1_thd0~0_90 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_85 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~x$r_buff1_thd0~0_90 0))) (= v_~x$flush_delayed~0_47 0) (= v_~x$w_buff1_used~0_136 (ite .cse0 v_~x$w_buff1_used~0_137 (ite (or .cse3 .cse5 .cse6) v_~x$w_buff1_used~0_137 0))) (= (ite .cse0 v_~x$mem_tmp~0_40 .cse7) v_~x~0_101) (= v_~x$w_buff0~0_78 v_~x$w_buff0~0_77) (= (ite .cse0 v_~x$r_buff0_thd0~0_86 (ite (or .cse3 (and .cse4 .cse8) .cse6) v_~x$r_buff0_thd0~0_86 (ite (and (not .cse3) .cse9) 0 v_~x$r_buff0_thd0~0_86))) v_~x$r_buff0_thd0~0_85) (or (= v_~weak$$choice2~0_42 1) (= v_~weak$$choice2~0_42 0)) (= v_~x$w_buff1~0_67 v_~x$w_buff1~0_66) (= v_~x$w_buff0_used~0_149 (ite .cse0 v_~x$w_buff0_used~0_150 (ite .cse10 v_~x$w_buff0_used~0_150 (ite .cse11 0 v_~x$w_buff0_used~0_150)))) (= v_~main$tmp_guard1~0_24 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_36 0) (= .cse7 2) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~__unbuffered_p2_EAX~0_38 1) (= v_~__unbuffered_p1_EAX~0_40 1))) 1 0) 0) 0 1)) (or (= v_~weak$$choice0~0_29 0) (= v_~weak$$choice0~0_29 1))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_78, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_36, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_137, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_90, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_36, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_35|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_41|, ~x$w_buff1~0=v_~x$w_buff1~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_136, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~weak$$choice2~0=v_~weak$$choice2~0_42, ~x~0=v_~x~0_101} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0][522], [Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 519#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 521#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 517#(and (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 273#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 534#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 296#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 545#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 546#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 303#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 304#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 568#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 567#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 319#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 584#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 330#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 603#true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 599#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 347#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 610#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 609#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 631#true, Black: 359#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 644#true, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, 279#true, Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 640#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 385#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 384#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 48#L760true, Black: 410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 510#true, Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 423#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 441#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~x$mem_tmp~0 0)), 33#L867true, Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 451#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 452#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 448#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 466#(and (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 351#true, Black: 467#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 469#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 482#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 339#true, Black: 480#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 483#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 200#true, 414#true, Black: 241#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 503#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 505#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 502#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 499#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-28 01:24:49,866 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,866 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,866 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:49,867 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 01:24:51,138 INFO L124 PetriNetUnfolderBase]: 9548/14729 cut-off events. [2024-06-28 01:24:51,139 INFO L125 PetriNetUnfolderBase]: For 686839/687365 co-relation queries the response was YES. [2024-06-28 01:24:51,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117402 conditions, 14729 events. 9548/14729 cut-off events. For 686839/687365 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 92368 event pairs, 3640 based on Foata normal form. 212/14562 useless extension candidates. Maximal degree in co-relation 117292. Up to 13150 conditions per place. [2024-06-28 01:24:51,526 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 537 selfloop transitions, 44 changer transitions 0/627 dead transitions. [2024-06-28 01:24:51,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 627 transitions, 11753 flow [2024-06-28 01:24:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:24:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:24:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-28 01:24:51,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-28 01:24:51,529 INFO L175 Difference]: Start difference. First operand has 245 places, 576 transitions, 9995 flow. Second operand 7 states and 168 transitions. [2024-06-28 01:24:51,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 627 transitions, 11753 flow [2024-06-28 01:24:52,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 627 transitions, 11178 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-28 01:24:52,616 INFO L231 Difference]: Finished difference. Result has 246 places, 589 transitions, 9736 flow [2024-06-28 01:24:52,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9420, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9736, PETRI_PLACES=246, PETRI_TRANSITIONS=589} [2024-06-28 01:24:52,616 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 191 predicate places. [2024-06-28 01:24:52,617 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 589 transitions, 9736 flow [2024-06-28 01:24:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:52,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:52,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:52,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:24:52,617 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:52,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1811257472, now seen corresponding path program 7 times [2024-06-28 01:24:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467235422] [2024-06-28 01:24:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:24:53,774 INFO L134 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:24:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:24:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467235422] [2024-06-28 01:24:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467235422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:24:53,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:24:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:24:53,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741256540] [2024-06-28 01:24:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:24:53,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:24:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:24:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:24:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:24:53,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:24:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 589 transitions, 9736 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:53,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:24:53,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:24:53,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:24:57,302 INFO L124 PetriNetUnfolderBase]: 8805/13749 cut-off events. [2024-06-28 01:24:57,302 INFO L125 PetriNetUnfolderBase]: For 739254/740049 co-relation queries the response was YES. [2024-06-28 01:24:57,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115449 conditions, 13749 events. 8805/13749 cut-off events. For 739254/740049 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 89040 event pairs, 2468 based on Foata normal form. 270/13554 useless extension candidates. Maximal degree in co-relation 115336. Up to 11467 conditions per place. [2024-06-28 01:24:57,667 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 428 selfloop transitions, 151 changer transitions 0/632 dead transitions. [2024-06-28 01:24:57,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 632 transitions, 11206 flow [2024-06-28 01:24:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:24:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:24:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-28 01:24:57,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-06-28 01:24:57,668 INFO L175 Difference]: Start difference. First operand has 246 places, 589 transitions, 9736 flow. Second operand 8 states and 203 transitions. [2024-06-28 01:24:57,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 632 transitions, 11206 flow [2024-06-28 01:24:58,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 632 transitions, 11056 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-28 01:24:58,985 INFO L231 Difference]: Finished difference. Result has 251 places, 592 transitions, 10056 flow [2024-06-28 01:24:58,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9586, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10056, PETRI_PLACES=251, PETRI_TRANSITIONS=592} [2024-06-28 01:24:58,986 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 196 predicate places. [2024-06-28 01:24:58,986 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 592 transitions, 10056 flow [2024-06-28 01:24:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:24:58,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:24:58,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:24:58,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:24:58,987 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:24:58,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:24:58,987 INFO L85 PathProgramCache]: Analyzing trace with hash -534089430, now seen corresponding path program 8 times [2024-06-28 01:24:58,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:24:58,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073203828] [2024-06-28 01:24:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:24:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:24:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073203828] [2024-06-28 01:25:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073203828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:00,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:25:00,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198461020] [2024-06-28 01:25:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:00,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:25:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:25:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:25:00,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 592 transitions, 10056 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:00,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:00,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:00,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:03,864 INFO L124 PetriNetUnfolderBase]: 8634/13607 cut-off events. [2024-06-28 01:25:03,864 INFO L125 PetriNetUnfolderBase]: For 712721/713070 co-relation queries the response was YES. [2024-06-28 01:25:04,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114516 conditions, 13607 events. 8634/13607 cut-off events. For 712721/713070 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 88691 event pairs, 2250 based on Foata normal form. 121/13307 useless extension candidates. Maximal degree in co-relation 114402. Up to 11472 conditions per place. [2024-06-28 01:25:04,289 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 454 selfloop transitions, 150 changer transitions 0/657 dead transitions. [2024-06-28 01:25:04,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 657 transitions, 11840 flow [2024-06-28 01:25:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:25:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:25:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-06-28 01:25:04,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988662131519274 [2024-06-28 01:25:04,291 INFO L175 Difference]: Start difference. First operand has 251 places, 592 transitions, 10056 flow. Second operand 9 states and 220 transitions. [2024-06-28 01:25:04,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 657 transitions, 11840 flow [2024-06-28 01:25:05,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 657 transitions, 11462 flow, removed 51 selfloop flow, removed 6 redundant places. [2024-06-28 01:25:05,764 INFO L231 Difference]: Finished difference. Result has 255 places, 607 transitions, 10321 flow [2024-06-28 01:25:05,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9684, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10321, PETRI_PLACES=255, PETRI_TRANSITIONS=607} [2024-06-28 01:25:05,765 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 200 predicate places. [2024-06-28 01:25:05,765 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 607 transitions, 10321 flow [2024-06-28 01:25:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:05,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:05,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:05,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:25:05,766 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:05,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 404080605, now seen corresponding path program 3 times [2024-06-28 01:25:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880995693] [2024-06-28 01:25:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880995693] [2024-06-28 01:25:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880995693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:25:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734989708] [2024-06-28 01:25:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:25:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:25:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:25:07,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:25:07,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 607 transitions, 10321 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:07,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:07,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:25:07,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:10,473 INFO L124 PetriNetUnfolderBase]: 9148/14233 cut-off events. [2024-06-28 01:25:10,473 INFO L125 PetriNetUnfolderBase]: For 740583/740647 co-relation queries the response was YES. [2024-06-28 01:25:10,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119888 conditions, 14233 events. 9148/14233 cut-off events. For 740583/740647 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 91495 event pairs, 2413 based on Foata normal form. 35/13915 useless extension candidates. Maximal degree in co-relation 119772. Up to 12076 conditions per place. [2024-06-28 01:25:10,684 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 464 selfloop transitions, 182 changer transitions 0/660 dead transitions. [2024-06-28 01:25:10,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 660 transitions, 12025 flow [2024-06-28 01:25:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:25:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:25:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-28 01:25:10,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056689342403629 [2024-06-28 01:25:10,686 INFO L175 Difference]: Start difference. First operand has 255 places, 607 transitions, 10321 flow. Second operand 9 states and 223 transitions. [2024-06-28 01:25:10,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 660 transitions, 12025 flow [2024-06-28 01:25:12,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 660 transitions, 11733 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:12,279 INFO L231 Difference]: Finished difference. Result has 260 places, 611 transitions, 10578 flow [2024-06-28 01:25:12,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10029, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10578, PETRI_PLACES=260, PETRI_TRANSITIONS=611} [2024-06-28 01:25:12,280 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 205 predicate places. [2024-06-28 01:25:12,280 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 611 transitions, 10578 flow [2024-06-28 01:25:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:12,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:12,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:12,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:25:12,281 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:12,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1811319007, now seen corresponding path program 3 times [2024-06-28 01:25:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141022401] [2024-06-28 01:25:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141022401] [2024-06-28 01:25:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141022401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:25:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584751577] [2024-06-28 01:25:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:13,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:25:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:13,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:25:13,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:25:13,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:25:13,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 611 transitions, 10578 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:13,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:13,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:25:13,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:16,797 INFO L124 PetriNetUnfolderBase]: 9208/14257 cut-off events. [2024-06-28 01:25:16,798 INFO L125 PetriNetUnfolderBase]: For 785434/785507 co-relation queries the response was YES. [2024-06-28 01:25:16,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122585 conditions, 14257 events. 9208/14257 cut-off events. For 785434/785507 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 91062 event pairs, 2812 based on Foata normal form. 21/13917 useless extension candidates. Maximal degree in co-relation 122468. Up to 12136 conditions per place. [2024-06-28 01:25:17,003 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 417 selfloop transitions, 230 changer transitions 0/661 dead transitions. [2024-06-28 01:25:17,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 661 transitions, 12302 flow [2024-06-28 01:25:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-28 01:25:17,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-28 01:25:17,008 INFO L175 Difference]: Start difference. First operand has 260 places, 611 transitions, 10578 flow. Second operand 8 states and 198 transitions. [2024-06-28 01:25:17,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 661 transitions, 12302 flow [2024-06-28 01:25:18,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 661 transitions, 11767 flow, removed 97 selfloop flow, removed 7 redundant places. [2024-06-28 01:25:18,949 INFO L231 Difference]: Finished difference. Result has 261 places, 620 transitions, 10825 flow [2024-06-28 01:25:18,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10071, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10825, PETRI_PLACES=261, PETRI_TRANSITIONS=620} [2024-06-28 01:25:18,950 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 206 predicate places. [2024-06-28 01:25:18,950 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 620 transitions, 10825 flow [2024-06-28 01:25:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:18,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:18,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:18,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:25:18,950 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:18,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1493210720, now seen corresponding path program 4 times [2024-06-28 01:25:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:18,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087120713] [2024-06-28 01:25:18,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:19,791 INFO L134 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:25:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087120713] [2024-06-28 01:25:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087120713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:19,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:25:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834232933] [2024-06-28 01:25:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:19,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:25:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:25:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:25:19,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-28 01:25:19,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 620 transitions, 10825 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:19,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:19,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-28 01:25:19,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand