./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix032.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix032.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:18:38,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:18:38,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:18:38,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:18:38,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:18:38,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:18:38,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:18:38,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:18:38,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:18:38,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:18:38,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:18:38,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:18:38,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:18:38,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:18:38,422 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:18:38,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:18:38,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:18:38,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:18:38,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:18:38,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:18:38,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:18:38,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:18:38,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:18:38,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:18:38,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:18:38,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:18:38,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:18:38,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:18:38,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:18:38,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:18:38,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:18:38,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:18:38,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:18:38,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:18:38,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:18:38,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:18:38,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:18:38,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:18:38,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:18:38,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:18:38,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:18:38,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:18:38,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:18:38,430 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-27 22:18:38,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:18:38,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:18:38,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:18:38,681 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:18:38,681 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:18:38,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix032.opt.yml/witness.yml [2024-06-27 22:18:38,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:18:38,764 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:18:38,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2024-06-27 22:18:39,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:18:40,084 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:18:40,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2024-06-27 22:18:40,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff82c53ef/76b95dfe7c244716bad846a069a10a75/FLAG075084474 [2024-06-27 22:18:40,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff82c53ef/76b95dfe7c244716bad846a069a10a75 [2024-06-27 22:18:40,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:18:40,108 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:18:40,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:18:40,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:18:40,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:18:40,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:38" (1/2) ... [2024-06-27 22:18:40,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dea76f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:18:40, skipping insertion in model container [2024-06-27 22:18:40,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:38" (1/2) ... [2024-06-27 22:18:40,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51629812 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:18:40, skipping insertion in model container [2024-06-27 22:18:40,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:18:40" (2/2) ... [2024-06-27 22:18:40,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dea76f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40, skipping insertion in model container [2024-06-27 22:18:40,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:18:40" (2/2) ... [2024-06-27 22:18:40,120 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:18:40,145 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:18:40,146 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )z) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:18:40,146 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )z) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:18:40,146 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL) && (0LL - (long long )z) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:18:40,146 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:18:40,147 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-27 22:18:40,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:18:40,318 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/mix032.opt.i[944,957] [2024-06-27 22:18:40,433 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:18:40,442 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:18:40,509 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/mix032.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:18:40,723 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:18:40,760 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:18:40,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40 WrapperNode [2024-06-27 22:18:40,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:18:40,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:18:40,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:18:40,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:18:40,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,845 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-06-27 22:18:40,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:18:40,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:18:40,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:18:40,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:18:40,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,879 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-27 22:18:40,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:18:40,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:18:40,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:18:40,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:18:40,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (1/1) ... [2024-06-27 22:18:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:18:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:18:40,941 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-27 22:18:40,962 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-27 22:18:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:18:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:18:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:18:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:18:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:18:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:18:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:18:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:18:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:18:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:18:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:18:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:18:40,993 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:18:41,127 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:18:41,130 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:18:41,478 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:18:41,482 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:18:41,610 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:18:41,610 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:18:41,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:18:41 BoogieIcfgContainer [2024-06-27 22:18:41,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:18:41,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:18:41,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:18:41,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:18:41,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:18:38" (1/4) ... [2024-06-27 22:18:41,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671ee87b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:18:41, skipping insertion in model container [2024-06-27 22:18:41,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:18:40" (2/4) ... [2024-06-27 22:18:41,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671ee87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:18:41, skipping insertion in model container [2024-06-27 22:18:41,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:18:40" (3/4) ... [2024-06-27 22:18:41,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671ee87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:18:41, skipping insertion in model container [2024-06-27 22:18:41,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:18:41" (4/4) ... [2024-06-27 22:18:41,621 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2024-06-27 22:18:41,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:18:41,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:18:41,634 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:18:41,682 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:18:41,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 112 flow [2024-06-27 22:18:41,740 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-06-27 22:18:41,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:18:41,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-06-27 22:18:41,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 50 transitions, 112 flow [2024-06-27 22:18:41,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 47 transitions, 103 flow [2024-06-27 22:18:41,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:18:41,766 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;@3a694ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:18:41,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:18:41,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:18:41,771 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:18:41,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:18:41,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:41,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:18:41,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:41,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash 329257932, now seen corresponding path program 1 times [2024-06-27 22:18:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652407842] [2024-06-27 22:18:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652407842] [2024-06-27 22:18:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652407842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:18:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178832757] [2024-06-27 22:18:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:18:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:18:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:18:43,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 22:18:43,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:43,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:43,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 22:18:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:43,872 INFO L124 PetriNetUnfolderBase]: 2986/5005 cut-off events. [2024-06-27 22:18:43,872 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 22:18:43,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9394 conditions, 5005 events. 2986/5005 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 33541 event pairs, 2435 based on Foata normal form. 150/4737 useless extension candidates. Maximal degree in co-relation 9382. Up to 4310 conditions per place. [2024-06-27 22:18:43,896 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 40 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-06-27 22:18:43,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 223 flow [2024-06-27 22:18:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:18:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:18:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 22:18:43,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-06-27 22:18:43,906 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 103 flow. Second operand 3 states and 107 transitions. [2024-06-27 22:18:43,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 223 flow [2024-06-27 22:18:43,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:18:43,911 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 130 flow [2024-06-27 22:18:43,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-27 22:18:43,914 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-06-27 22:18:43,914 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 130 flow [2024-06-27 22:18:43,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:43,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:43,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:43,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:18:43,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:43,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1409440139, now seen corresponding path program 1 times [2024-06-27 22:18:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528097700] [2024-06-27 22:18:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528097700] [2024-06-27 22:18:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528097700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:18:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059683070] [2024-06-27 22:18:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:45,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:18:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:45,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:18:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:18:45,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 22:18:45,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:45,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:45,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 22:18:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:45,688 INFO L124 PetriNetUnfolderBase]: 3390/5218 cut-off events. [2024-06-27 22:18:45,688 INFO L125 PetriNetUnfolderBase]: For 763/767 co-relation queries the response was YES. [2024-06-27 22:18:45,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11335 conditions, 5218 events. 3390/5218 cut-off events. For 763/767 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 31999 event pairs, 1817 based on Foata normal form. 5/5000 useless extension candidates. Maximal degree in co-relation 11323. Up to 4856 conditions per place. [2024-06-27 22:18:45,715 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 52 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-06-27 22:18:45,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 310 flow [2024-06-27 22:18:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:18:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:18:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-27 22:18:45,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-06-27 22:18:45,717 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 130 flow. Second operand 4 states and 135 transitions. [2024-06-27 22:18:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 310 flow [2024-06-27 22:18:45,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:18:45,720 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 168 flow [2024-06-27 22:18:45,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-27 22:18:45,721 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-06-27 22:18:45,721 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 168 flow [2024-06-27 22:18:45,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:45,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:45,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:45,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:18:45,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:45,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -742970431, now seen corresponding path program 1 times [2024-06-27 22:18:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507312831] [2024-06-27 22:18:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507312831] [2024-06-27 22:18:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507312831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:47,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:18:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091170710] [2024-06-27 22:18:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:47,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:18:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:18:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:18:47,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2024-06-27 22:18:47,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:47,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:47,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2024-06-27 22:18:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:47,786 INFO L124 PetriNetUnfolderBase]: 4062/6614 cut-off events. [2024-06-27 22:18:47,786 INFO L125 PetriNetUnfolderBase]: For 2419/2421 co-relation queries the response was YES. [2024-06-27 22:18:47,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15123 conditions, 6614 events. 4062/6614 cut-off events. For 2419/2421 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 43210 event pairs, 1770 based on Foata normal form. 7/6239 useless extension candidates. Maximal degree in co-relation 15109. Up to 5700 conditions per place. [2024-06-27 22:18:47,824 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 68 selfloop transitions, 14 changer transitions 0/96 dead transitions. [2024-06-27 22:18:47,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 456 flow [2024-06-27 22:18:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:18:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:18:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-06-27 22:18:47,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-27 22:18:47,829 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 168 flow. Second operand 5 states and 170 transitions. [2024-06-27 22:18:47,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 456 flow [2024-06-27 22:18:47,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 442 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:18:47,832 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 243 flow [2024-06-27 22:18:47,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-27 22:18:47,833 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 22:18:47,833 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 243 flow [2024-06-27 22:18:47,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:47,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:47,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:47,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:18:47,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:47,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 693118218, now seen corresponding path program 1 times [2024-06-27 22:18:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323798153] [2024-06-27 22:18:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323798153] [2024-06-27 22:18:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323798153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:18:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549608897] [2024-06-27 22:18:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:18:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:18:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:18:49,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2024-06-27 22:18:49,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:49,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:49,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2024-06-27 22:18:49,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:50,224 INFO L124 PetriNetUnfolderBase]: 4057/6627 cut-off events. [2024-06-27 22:18:50,224 INFO L125 PetriNetUnfolderBase]: For 6427/6430 co-relation queries the response was YES. [2024-06-27 22:18:50,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16917 conditions, 6627 events. 4057/6627 cut-off events. For 6427/6430 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 43511 event pairs, 1793 based on Foata normal form. 37/6436 useless extension candidates. Maximal degree in co-relation 16901. Up to 5613 conditions per place. [2024-06-27 22:18:50,260 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 76 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-06-27 22:18:50,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 563 flow [2024-06-27 22:18:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:18:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:18:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-06-27 22:18:50,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6566666666666666 [2024-06-27 22:18:50,262 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 243 flow. Second operand 6 states and 197 transitions. [2024-06-27 22:18:50,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 563 flow [2024-06-27 22:18:50,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 551 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 22:18:50,268 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 293 flow [2024-06-27 22:18:50,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-27 22:18:50,270 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2024-06-27 22:18:50,270 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 293 flow [2024-06-27 22:18:50,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:50,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:50,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:50,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:18:50,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:50,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -526563811, now seen corresponding path program 1 times [2024-06-27 22:18:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286777769] [2024-06-27 22:18:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286777769] [2024-06-27 22:18:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286777769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:18:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831298785] [2024-06-27 22:18:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:51,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:18:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:51,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:18:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:18:51,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:18:51,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:51,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:51,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:18:51,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:52,934 INFO L124 PetriNetUnfolderBase]: 4781/7864 cut-off events. [2024-06-27 22:18:52,935 INFO L125 PetriNetUnfolderBase]: For 12135/12135 co-relation queries the response was YES. [2024-06-27 22:18:52,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21267 conditions, 7864 events. 4781/7864 cut-off events. For 12135/12135 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 53129 event pairs, 3065 based on Foata normal form. 2/7580 useless extension candidates. Maximal degree in co-relation 21248. Up to 6811 conditions per place. [2024-06-27 22:18:52,973 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 67 selfloop transitions, 17 changer transitions 0/96 dead transitions. [2024-06-27 22:18:52,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 602 flow [2024-06-27 22:18:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:18:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:18:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-06-27 22:18:52,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 22:18:52,975 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 293 flow. Second operand 6 states and 160 transitions. [2024-06-27 22:18:52,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 602 flow [2024-06-27 22:18:52,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 546 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:18:52,984 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 409 flow [2024-06-27 22:18:52,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2024-06-27 22:18:52,985 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-06-27 22:18:52,989 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 409 flow [2024-06-27 22:18:52,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:52,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:52,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:52,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:18:52,990 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:52,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -288476192, now seen corresponding path program 1 times [2024-06-27 22:18:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617942589] [2024-06-27 22:18:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617942589] [2024-06-27 22:18:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617942589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:54,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:18:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017950956] [2024-06-27 22:18:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:54,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:18:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:18:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:18:54,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:18:54,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 409 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:54,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:54,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:18:54,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:56,110 INFO L124 PetriNetUnfolderBase]: 4775/7898 cut-off events. [2024-06-27 22:18:56,111 INFO L125 PetriNetUnfolderBase]: For 15805/15805 co-relation queries the response was YES. [2024-06-27 22:18:56,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22821 conditions, 7898 events. 4775/7898 cut-off events. For 15805/15805 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 53719 event pairs, 3004 based on Foata normal form. 2/7643 useless extension candidates. Maximal degree in co-relation 22796. Up to 6790 conditions per place. [2024-06-27 22:18:56,160 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 73 selfloop transitions, 22 changer transitions 0/107 dead transitions. [2024-06-27 22:18:56,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 699 flow [2024-06-27 22:18:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:18:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:18:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 22:18:56,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2024-06-27 22:18:56,162 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 409 flow. Second operand 7 states and 186 transitions. [2024-06-27 22:18:56,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 699 flow [2024-06-27 22:18:56,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 683 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-27 22:18:56,169 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 497 flow [2024-06-27 22:18:56,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=497, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2024-06-27 22:18:56,170 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2024-06-27 22:18:56,170 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 497 flow [2024-06-27 22:18:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:56,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:56,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:18:56,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:56,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1487697202, now seen corresponding path program 1 times [2024-06-27 22:18:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689727647] [2024-06-27 22:18:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689727647] [2024-06-27 22:18:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689727647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:18:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298266260] [2024-06-27 22:18:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:18:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:18:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:18:57,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:18:57,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:57,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:57,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:18:57,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:58,927 INFO L124 PetriNetUnfolderBase]: 5359/8789 cut-off events. [2024-06-27 22:18:58,928 INFO L125 PetriNetUnfolderBase]: For 22491/22498 co-relation queries the response was YES. [2024-06-27 22:18:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27377 conditions, 8789 events. 5359/8789 cut-off events. For 22491/22498 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 59880 event pairs, 2995 based on Foata normal form. 8/8490 useless extension candidates. Maximal degree in co-relation 27347. Up to 7533 conditions per place. [2024-06-27 22:18:58,970 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 117 selfloop transitions, 51 changer transitions 0/181 dead transitions. [2024-06-27 22:18:58,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 181 transitions, 1275 flow [2024-06-27 22:18:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:18:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:18:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 318 transitions. [2024-06-27 22:18:58,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 22:18:58,972 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 497 flow. Second operand 12 states and 318 transitions. [2024-06-27 22:18:58,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 181 transitions, 1275 flow [2024-06-27 22:18:58,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 181 transitions, 1217 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 22:18:58,983 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 903 flow [2024-06-27 22:18:58,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=903, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2024-06-27 22:18:58,984 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-06-27 22:18:58,984 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 125 transitions, 903 flow [2024-06-27 22:18:58,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:58,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:58,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:58,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:18:58,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:18:58,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash 368426754, now seen corresponding path program 2 times [2024-06-27 22:18:58,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:58,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86152539] [2024-06-27 22:18:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86152539] [2024-06-27 22:19:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86152539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:00,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217172799] [2024-06-27 22:19:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:00,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:00,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:00,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:19:00,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 125 transitions, 903 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:00,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:00,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:19:00,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:01,790 INFO L124 PetriNetUnfolderBase]: 5406/8872 cut-off events. [2024-06-27 22:19:01,791 INFO L125 PetriNetUnfolderBase]: For 29630/29634 co-relation queries the response was YES. [2024-06-27 22:19:01,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30172 conditions, 8872 events. 5406/8872 cut-off events. For 29630/29634 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 60071 event pairs, 2608 based on Foata normal form. 7/8592 useless extension candidates. Maximal degree in co-relation 30136. Up to 7617 conditions per place. [2024-06-27 22:19:01,840 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 120 selfloop transitions, 48 changer transitions 0/181 dead transitions. [2024-06-27 22:19:01,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 181 transitions, 1572 flow [2024-06-27 22:19:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-27 22:19:01,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-27 22:19:01,842 INFO L175 Difference]: Start difference. First operand has 91 places, 125 transitions, 903 flow. Second operand 8 states and 215 transitions. [2024-06-27 22:19:01,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 181 transitions, 1572 flow [2024-06-27 22:19:01,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 181 transitions, 1436 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:01,877 INFO L231 Difference]: Finished difference. Result has 96 places, 147 transitions, 1129 flow [2024-06-27 22:19:01,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1129, PETRI_PLACES=96, PETRI_TRANSITIONS=147} [2024-06-27 22:19:01,879 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2024-06-27 22:19:01,879 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 147 transitions, 1129 flow [2024-06-27 22:19:01,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:01,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:01,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:19:01,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:01,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 919531368, now seen corresponding path program 1 times [2024-06-27 22:19:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769509856] [2024-06-27 22:19:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769509856] [2024-06-27 22:19:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769509856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774029890] [2024-06-27 22:19:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:03,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:03,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:03,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:03,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 147 transitions, 1129 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:03,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:03,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:03,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:04,560 INFO L124 PetriNetUnfolderBase]: 5712/9209 cut-off events. [2024-06-27 22:19:04,560 INFO L125 PetriNetUnfolderBase]: For 32329/32339 co-relation queries the response was YES. [2024-06-27 22:19:04,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31435 conditions, 9209 events. 5712/9209 cut-off events. For 32329/32339 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 61203 event pairs, 3143 based on Foata normal form. 8/8957 useless extension candidates. Maximal degree in co-relation 31398. Up to 7996 conditions per place. [2024-06-27 22:19:04,604 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 146 selfloop transitions, 49 changer transitions 0/206 dead transitions. [2024-06-27 22:19:04,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 206 transitions, 1917 flow [2024-06-27 22:19:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-06-27 22:19:04,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545 [2024-06-27 22:19:04,608 INFO L175 Difference]: Start difference. First operand has 96 places, 147 transitions, 1129 flow. Second operand 8 states and 218 transitions. [2024-06-27 22:19:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 206 transitions, 1917 flow [2024-06-27 22:19:04,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 206 transitions, 1863 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:04,639 INFO L231 Difference]: Finished difference. Result has 102 places, 168 transitions, 1412 flow [2024-06-27 22:19:04,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=102, PETRI_TRANSITIONS=168} [2024-06-27 22:19:04,640 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 46 predicate places. [2024-06-27 22:19:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 168 transitions, 1412 flow [2024-06-27 22:19:04,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:04,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:04,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:19:04,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:04,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 427856224, now seen corresponding path program 3 times [2024-06-27 22:19:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537257193] [2024-06-27 22:19:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537257193] [2024-06-27 22:19:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537257193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:06,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595897003] [2024-06-27 22:19:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:06,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:06,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:19:06,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 168 transitions, 1412 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:06,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:06,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:19:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:07,752 INFO L124 PetriNetUnfolderBase]: 5532/9067 cut-off events. [2024-06-27 22:19:07,752 INFO L125 PetriNetUnfolderBase]: For 39480/39480 co-relation queries the response was YES. [2024-06-27 22:19:07,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33058 conditions, 9067 events. 5532/9067 cut-off events. For 39480/39480 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 61171 event pairs, 2402 based on Foata normal form. 3/8811 useless extension candidates. Maximal degree in co-relation 33019. Up to 7713 conditions per place. [2024-06-27 22:19:07,803 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 137 selfloop transitions, 73 changer transitions 0/226 dead transitions. [2024-06-27 22:19:07,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 226 transitions, 2251 flow [2024-06-27 22:19:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:19:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-06-27 22:19:07,805 INFO L175 Difference]: Start difference. First operand has 102 places, 168 transitions, 1412 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:19:07,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 226 transitions, 2251 flow [2024-06-27 22:19:07,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 226 transitions, 2154 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:07,845 INFO L231 Difference]: Finished difference. Result has 108 places, 198 transitions, 1844 flow [2024-06-27 22:19:07,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1844, PETRI_PLACES=108, PETRI_TRANSITIONS=198} [2024-06-27 22:19:07,846 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 52 predicate places. [2024-06-27 22:19:07,846 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 198 transitions, 1844 flow [2024-06-27 22:19:07,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:07,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:07,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:19:07,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:07,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -530204032, now seen corresponding path program 2 times [2024-06-27 22:19:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069961474] [2024-06-27 22:19:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069961474] [2024-06-27 22:19:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069961474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:09,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826618245] [2024-06-27 22:19:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:09,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:09,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:09,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 198 transitions, 1844 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:09,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:09,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:09,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:11,011 INFO L124 PetriNetUnfolderBase]: 5896/9477 cut-off events. [2024-06-27 22:19:11,011 INFO L125 PetriNetUnfolderBase]: For 44447/44455 co-relation queries the response was YES. [2024-06-27 22:19:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35312 conditions, 9477 events. 5896/9477 cut-off events. For 44447/44455 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 62735 event pairs, 3111 based on Foata normal form. 9/9217 useless extension candidates. Maximal degree in co-relation 35270. Up to 8188 conditions per place. [2024-06-27 22:19:11,092 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 169 selfloop transitions, 75 changer transitions 0/255 dead transitions. [2024-06-27 22:19:11,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 255 transitions, 2758 flow [2024-06-27 22:19:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-06-27 22:19:11,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:19:11,096 INFO L175 Difference]: Start difference. First operand has 108 places, 198 transitions, 1844 flow. Second operand 7 states and 190 transitions. [2024-06-27 22:19:11,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 255 transitions, 2758 flow [2024-06-27 22:19:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 255 transitions, 2694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:11,150 INFO L231 Difference]: Finished difference. Result has 114 places, 224 transitions, 2223 flow [2024-06-27 22:19:11,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2223, PETRI_PLACES=114, PETRI_TRANSITIONS=224} [2024-06-27 22:19:11,150 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-06-27 22:19:11,150 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 224 transitions, 2223 flow [2024-06-27 22:19:11,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:11,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:11,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:11,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:19:11,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:11,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 778338300, now seen corresponding path program 3 times [2024-06-27 22:19:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043724917] [2024-06-27 22:19:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043724917] [2024-06-27 22:19:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043724917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650388585] [2024-06-27 22:19:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:12,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:12,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:12,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 224 transitions, 2223 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:12,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:12,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:14,337 INFO L124 PetriNetUnfolderBase]: 5936/9524 cut-off events. [2024-06-27 22:19:14,337 INFO L125 PetriNetUnfolderBase]: For 49090/49100 co-relation queries the response was YES. [2024-06-27 22:19:14,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36187 conditions, 9524 events. 5936/9524 cut-off events. For 49090/49100 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 62873 event pairs, 3092 based on Foata normal form. 13/9268 useless extension candidates. Maximal degree in co-relation 36141. Up to 8230 conditions per place. [2024-06-27 22:19:14,392 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 167 selfloop transitions, 90 changer transitions 0/268 dead transitions. [2024-06-27 22:19:14,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 268 transitions, 3082 flow [2024-06-27 22:19:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 22:19:14,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2024-06-27 22:19:14,395 INFO L175 Difference]: Start difference. First operand has 114 places, 224 transitions, 2223 flow. Second operand 7 states and 186 transitions. [2024-06-27 22:19:14,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 268 transitions, 3082 flow [2024-06-27 22:19:14,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 268 transitions, 2960 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:14,448 INFO L231 Difference]: Finished difference. Result has 120 places, 237 transitions, 2494 flow [2024-06-27 22:19:14,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2494, PETRI_PLACES=120, PETRI_TRANSITIONS=237} [2024-06-27 22:19:14,449 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 64 predicate places. [2024-06-27 22:19:14,449 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 237 transitions, 2494 flow [2024-06-27 22:19:14,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:14,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:14,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:14,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:19:14,450 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:14,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash -357829680, now seen corresponding path program 4 times [2024-06-27 22:19:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221045449] [2024-06-27 22:19:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221045449] [2024-06-27 22:19:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221045449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239276704] [2024-06-27 22:19:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:15,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:16,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:16,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 237 transitions, 2494 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:16,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:16,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:16,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:17,623 INFO L124 PetriNetUnfolderBase]: 5926/9513 cut-off events. [2024-06-27 22:19:17,624 INFO L125 PetriNetUnfolderBase]: For 53175/53183 co-relation queries the response was YES. [2024-06-27 22:19:17,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36489 conditions, 9513 events. 5926/9513 cut-off events. For 53175/53183 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 62784 event pairs, 3097 based on Foata normal form. 11/9255 useless extension candidates. Maximal degree in co-relation 36439. Up to 8220 conditions per place. [2024-06-27 22:19:17,696 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 167 selfloop transitions, 87 changer transitions 0/265 dead transitions. [2024-06-27 22:19:17,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 265 transitions, 3124 flow [2024-06-27 22:19:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 22:19:17,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2024-06-27 22:19:17,698 INFO L175 Difference]: Start difference. First operand has 120 places, 237 transitions, 2494 flow. Second operand 7 states and 186 transitions. [2024-06-27 22:19:17,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 265 transitions, 3124 flow [2024-06-27 22:19:17,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 265 transitions, 2850 flow, removed 88 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:17,789 INFO L231 Difference]: Finished difference. Result has 124 places, 237 transitions, 2411 flow [2024-06-27 22:19:17,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2411, PETRI_PLACES=124, PETRI_TRANSITIONS=237} [2024-06-27 22:19:17,790 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places. [2024-06-27 22:19:17,790 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 237 transitions, 2411 flow [2024-06-27 22:19:17,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:17,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:17,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:19:17,791 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:17,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash -352826434, now seen corresponding path program 1 times [2024-06-27 22:19:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:17,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660390398] [2024-06-27 22:19:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660390398] [2024-06-27 22:19:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660390398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:19,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:19,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19947875] [2024-06-27 22:19:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:19,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:19,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:20,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:19:20,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 237 transitions, 2411 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:20,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:20,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:19:20,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:21,591 INFO L124 PetriNetUnfolderBase]: 5165/8460 cut-off events. [2024-06-27 22:19:21,592 INFO L125 PetriNetUnfolderBase]: For 49327/49327 co-relation queries the response was YES. [2024-06-27 22:19:21,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32642 conditions, 8460 events. 5165/8460 cut-off events. For 49327/49327 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 56253 event pairs, 2815 based on Foata normal form. 20/8211 useless extension candidates. Maximal degree in co-relation 32589. Up to 7264 conditions per place. [2024-06-27 22:19:21,653 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 251 selfloop transitions, 35 changer transitions 1/299 dead transitions. [2024-06-27 22:19:21,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 299 transitions, 3280 flow [2024-06-27 22:19:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-06-27 22:19:21,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5488888888888889 [2024-06-27 22:19:21,655 INFO L175 Difference]: Start difference. First operand has 124 places, 237 transitions, 2411 flow. Second operand 9 states and 247 transitions. [2024-06-27 22:19:21,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 299 transitions, 3280 flow [2024-06-27 22:19:21,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 299 transitions, 3163 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:21,722 INFO L231 Difference]: Finished difference. Result has 134 places, 251 transitions, 2540 flow [2024-06-27 22:19:21,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2540, PETRI_PLACES=134, PETRI_TRANSITIONS=251} [2024-06-27 22:19:21,722 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-06-27 22:19:21,723 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 251 transitions, 2540 flow [2024-06-27 22:19:21,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:21,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:21,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:21,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:19:21,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:21,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -736350810, now seen corresponding path program 1 times [2024-06-27 22:19:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30411550] [2024-06-27 22:19:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30411550] [2024-06-27 22:19:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30411550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:19:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149205883] [2024-06-27 22:19:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:22,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:19:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:19:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:19:22,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2024-06-27 22:19:22,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 251 transitions, 2540 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-27 22:19:22,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:22,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2024-06-27 22:19:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:23,934 INFO L124 PetriNetUnfolderBase]: 4905/8197 cut-off events. [2024-06-27 22:19:23,934 INFO L125 PetriNetUnfolderBase]: For 73529/73745 co-relation queries the response was YES. [2024-06-27 22:19:23,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34967 conditions, 8197 events. 4905/8197 cut-off events. For 73529/73745 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 56292 event pairs, 2709 based on Foata normal form. 93/7878 useless extension candidates. Maximal degree in co-relation 34907. Up to 6861 conditions per place. [2024-06-27 22:19:23,999 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 213 selfloop transitions, 15 changer transitions 0/266 dead transitions. [2024-06-27 22:19:23,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 266 transitions, 3076 flow [2024-06-27 22:19:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:19:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:19:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-27 22:19:24,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.552 [2024-06-27 22:19:24,000 INFO L175 Difference]: Start difference. First operand has 134 places, 251 transitions, 2540 flow. Second operand 5 states and 138 transitions. [2024-06-27 22:19:24,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 266 transitions, 3076 flow [2024-06-27 22:19:24,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 266 transitions, 2999 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:24,082 INFO L231 Difference]: Finished difference. Result has 137 places, 255 transitions, 2545 flow [2024-06-27 22:19:24,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2463, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2545, PETRI_PLACES=137, PETRI_TRANSITIONS=255} [2024-06-27 22:19:24,083 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-06-27 22:19:24,083 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 255 transitions, 2545 flow [2024-06-27 22:19:24,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-27 22:19:24,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:24,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:24,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:19:24,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:24,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 743545087, now seen corresponding path program 1 times [2024-06-27 22:19:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339973567] [2024-06-27 22:19:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339973567] [2024-06-27 22:19:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339973567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792562903] [2024-06-27 22:19:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:25,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:26,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:26,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 255 transitions, 2545 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:26,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:26,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:26,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:27,819 INFO L124 PetriNetUnfolderBase]: 5918/9639 cut-off events. [2024-06-27 22:19:27,819 INFO L125 PetriNetUnfolderBase]: For 82121/82127 co-relation queries the response was YES. [2024-06-27 22:19:27,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41328 conditions, 9639 events. 5918/9639 cut-off events. For 82121/82127 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 64387 event pairs, 2983 based on Foata normal form. 6/9349 useless extension candidates. Maximal degree in co-relation 41266. Up to 8117 conditions per place. [2024-06-27 22:19:27,909 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 199 selfloop transitions, 99 changer transitions 0/309 dead transitions. [2024-06-27 22:19:27,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 309 transitions, 3629 flow [2024-06-27 22:19:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:19:27,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475 [2024-06-27 22:19:27,913 INFO L175 Difference]: Start difference. First operand has 137 places, 255 transitions, 2545 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:19:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 309 transitions, 3629 flow [2024-06-27 22:19:28,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 309 transitions, 3581 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:28,019 INFO L231 Difference]: Finished difference. Result has 142 places, 270 transitions, 2923 flow [2024-06-27 22:19:28,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2923, PETRI_PLACES=142, PETRI_TRANSITIONS=270} [2024-06-27 22:19:28,020 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 86 predicate places. [2024-06-27 22:19:28,020 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 270 transitions, 2923 flow [2024-06-27 22:19:28,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:28,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:28,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:28,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:19:28,022 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:28,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1007014022, now seen corresponding path program 1 times [2024-06-27 22:19:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837155067] [2024-06-27 22:19:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837155067] [2024-06-27 22:19:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837155067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120023273] [2024-06-27 22:19:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:29,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:29,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:29,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 270 transitions, 2923 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:29,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:29,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:29,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:31,390 INFO L124 PetriNetUnfolderBase]: 5990/9722 cut-off events. [2024-06-27 22:19:31,390 INFO L125 PetriNetUnfolderBase]: For 92616/92622 co-relation queries the response was YES. [2024-06-27 22:19:31,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43938 conditions, 9722 events. 5990/9722 cut-off events. For 92616/92622 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 64343 event pairs, 2889 based on Foata normal form. 8/9436 useless extension candidates. Maximal degree in co-relation 43874. Up to 8216 conditions per place. [2024-06-27 22:19:31,472 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 217 selfloop transitions, 128 changer transitions 0/356 dead transitions. [2024-06-27 22:19:31,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 356 transitions, 4213 flow [2024-06-27 22:19:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:19:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:19:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 360 transitions. [2024-06-27 22:19:31,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:19:31,475 INFO L175 Difference]: Start difference. First operand has 142 places, 270 transitions, 2923 flow. Second operand 14 states and 360 transitions. [2024-06-27 22:19:31,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 356 transitions, 4213 flow [2024-06-27 22:19:31,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 356 transitions, 4100 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:31,632 INFO L231 Difference]: Finished difference. Result has 153 places, 287 transitions, 3352 flow [2024-06-27 22:19:31,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2810, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3352, PETRI_PLACES=153, PETRI_TRANSITIONS=287} [2024-06-27 22:19:31,632 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 97 predicate places. [2024-06-27 22:19:31,633 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 287 transitions, 3352 flow [2024-06-27 22:19:31,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:31,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:31,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:31,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:19:31,633 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:31,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1463671650, now seen corresponding path program 2 times [2024-06-27 22:19:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48720988] [2024-06-27 22:19:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:33,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-27 22:19:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48720988] [2024-06-27 22:19:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48720988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974053266] [2024-06-27 22:19:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:33,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:33,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 287 transitions, 3352 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:33,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:33,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:33,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:34,891 INFO L124 PetriNetUnfolderBase]: 6048/9755 cut-off events. [2024-06-27 22:19:34,891 INFO L125 PetriNetUnfolderBase]: For 106565/106569 co-relation queries the response was YES. [2024-06-27 22:19:34,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46943 conditions, 9755 events. 6048/9755 cut-off events. For 106565/106569 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 63909 event pairs, 2543 based on Foata normal form. 7/9475 useless extension candidates. Maximal degree in co-relation 46876. Up to 8403 conditions per place. [2024-06-27 22:19:34,967 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 240 selfloop transitions, 92 changer transitions 0/343 dead transitions. [2024-06-27 22:19:34,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 343 transitions, 4468 flow [2024-06-27 22:19:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-06-27 22:19:34,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177777777777778 [2024-06-27 22:19:34,971 INFO L175 Difference]: Start difference. First operand has 153 places, 287 transitions, 3352 flow. Second operand 9 states and 233 transitions. [2024-06-27 22:19:34,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 343 transitions, 4468 flow [2024-06-27 22:19:35,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 343 transitions, 4096 flow, removed 129 selfloop flow, removed 9 redundant places. [2024-06-27 22:19:35,118 INFO L231 Difference]: Finished difference. Result has 153 places, 302 transitions, 3503 flow [2024-06-27 22:19:35,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3114, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3503, PETRI_PLACES=153, PETRI_TRANSITIONS=302} [2024-06-27 22:19:35,118 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 97 predicate places. [2024-06-27 22:19:35,119 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 302 transitions, 3503 flow [2024-06-27 22:19:35,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:35,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:35,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:35,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:19:35,119 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:35,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1559303566, now seen corresponding path program 3 times [2024-06-27 22:19:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637498671] [2024-06-27 22:19:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637498671] [2024-06-27 22:19:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637498671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521162992] [2024-06-27 22:19:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:36,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:36,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:36,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:36,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 302 transitions, 3503 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:36,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:36,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:36,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:38,504 INFO L124 PetriNetUnfolderBase]: 6152/9936 cut-off events. [2024-06-27 22:19:38,505 INFO L125 PetriNetUnfolderBase]: For 111774/111776 co-relation queries the response was YES. [2024-06-27 22:19:38,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47843 conditions, 9936 events. 6152/9936 cut-off events. For 111774/111776 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 65232 event pairs, 2537 based on Foata normal form. 2/9634 useless extension candidates. Maximal degree in co-relation 47774. Up to 8148 conditions per place. [2024-06-27 22:19:38,722 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 174 selfloop transitions, 198 changer transitions 0/383 dead transitions. [2024-06-27 22:19:38,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 383 transitions, 5077 flow [2024-06-27 22:19:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2024-06-27 22:19:38,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:19:38,724 INFO L175 Difference]: Start difference. First operand has 153 places, 302 transitions, 3503 flow. Second operand 9 states and 250 transitions. [2024-06-27 22:19:38,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 383 transitions, 5077 flow [2024-06-27 22:19:38,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 383 transitions, 4834 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-27 22:19:38,892 INFO L231 Difference]: Finished difference. Result has 157 places, 335 transitions, 4198 flow [2024-06-27 22:19:38,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3260, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4198, PETRI_PLACES=157, PETRI_TRANSITIONS=335} [2024-06-27 22:19:38,893 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 101 predicate places. [2024-06-27 22:19:38,893 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 335 transitions, 4198 flow [2024-06-27 22:19:38,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:38,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:38,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:38,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:19:38,895 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:38,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1559297986, now seen corresponding path program 4 times [2024-06-27 22:19:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:38,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907686677] [2024-06-27 22:19:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:40,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907686677] [2024-06-27 22:19:40,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907686677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:40,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258962479] [2024-06-27 22:19:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:40,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:40,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:40,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 335 transitions, 4198 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:40,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:40,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:42,336 INFO L124 PetriNetUnfolderBase]: 6146/9928 cut-off events. [2024-06-27 22:19:42,337 INFO L125 PetriNetUnfolderBase]: For 126242/126244 co-relation queries the response was YES. [2024-06-27 22:19:42,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50305 conditions, 9928 events. 6146/9928 cut-off events. For 126242/126244 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 65216 event pairs, 2537 based on Foata normal form. 2/9618 useless extension candidates. Maximal degree in co-relation 50233. Up to 8142 conditions per place. [2024-06-27 22:19:42,436 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 164 selfloop transitions, 207 changer transitions 0/382 dead transitions. [2024-06-27 22:19:42,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 382 transitions, 5306 flow [2024-06-27 22:19:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions. [2024-06-27 22:19:42,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-06-27 22:19:42,443 INFO L175 Difference]: Start difference. First operand has 157 places, 335 transitions, 4198 flow. Second operand 9 states and 246 transitions. [2024-06-27 22:19:42,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 382 transitions, 5306 flow [2024-06-27 22:19:42,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 382 transitions, 5008 flow, removed 108 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:42,689 INFO L231 Difference]: Finished difference. Result has 163 places, 336 transitions, 4366 flow [2024-06-27 22:19:42,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3936, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4366, PETRI_PLACES=163, PETRI_TRANSITIONS=336} [2024-06-27 22:19:42,690 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-27 22:19:42,690 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 336 transitions, 4366 flow [2024-06-27 22:19:42,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:42,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:42,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:42,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:19:42,691 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:42,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:42,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1559297769, now seen corresponding path program 2 times [2024-06-27 22:19:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:42,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802775370] [2024-06-27 22:19:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:42,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802775370] [2024-06-27 22:19:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802775370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431441516] [2024-06-27 22:19:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:44,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:44,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 336 transitions, 4366 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:44,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:44,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:44,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:46,164 INFO L124 PetriNetUnfolderBase]: 6198/10019 cut-off events. [2024-06-27 22:19:46,164 INFO L125 PetriNetUnfolderBase]: For 128437/128443 co-relation queries the response was YES. [2024-06-27 22:19:46,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49780 conditions, 10019 events. 6198/10019 cut-off events. For 128437/128443 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 65994 event pairs, 2946 based on Foata normal form. 6/9711 useless extension candidates. Maximal degree in co-relation 49706. Up to 8471 conditions per place. [2024-06-27 22:19:46,243 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 267 selfloop transitions, 119 changer transitions 0/397 dead transitions. [2024-06-27 22:19:46,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 397 transitions, 5657 flow [2024-06-27 22:19:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:19:46,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-27 22:19:46,245 INFO L175 Difference]: Start difference. First operand has 163 places, 336 transitions, 4366 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:19:46,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 397 transitions, 5657 flow [2024-06-27 22:19:46,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 397 transitions, 5282 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 22:19:46,489 INFO L231 Difference]: Finished difference. Result has 167 places, 353 transitions, 4495 flow [2024-06-27 22:19:46,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3991, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4495, PETRI_PLACES=167, PETRI_TRANSITIONS=353} [2024-06-27 22:19:46,490 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2024-06-27 22:19:46,490 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 353 transitions, 4495 flow [2024-06-27 22:19:46,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:46,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:46,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:46,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:19:46,491 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:46,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash 739820220, now seen corresponding path program 5 times [2024-06-27 22:19:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351588429] [2024-06-27 22:19:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351588429] [2024-06-27 22:19:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351588429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972795194] [2024-06-27 22:19:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:48,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:48,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:48,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 353 transitions, 4495 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:48,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:48,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:48,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:50,117 INFO L124 PetriNetUnfolderBase]: 6240/10065 cut-off events. [2024-06-27 22:19:50,117 INFO L125 PetriNetUnfolderBase]: For 129603/129603 co-relation queries the response was YES. [2024-06-27 22:19:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50490 conditions, 10065 events. 6240/10065 cut-off events. For 129603/129603 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 65925 event pairs, 2334 based on Foata normal form. 3/9735 useless extension candidates. Maximal degree in co-relation 50414. Up to 8646 conditions per place. [2024-06-27 22:19:50,185 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 292 selfloop transitions, 103 changer transitions 0/406 dead transitions. [2024-06-27 22:19:50,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 406 transitions, 5591 flow [2024-06-27 22:19:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:19:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:19:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:19:50,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955555555555556 [2024-06-27 22:19:50,187 INFO L175 Difference]: Start difference. First operand has 167 places, 353 transitions, 4495 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:19:50,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 406 transitions, 5591 flow [2024-06-27 22:19:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 406 transitions, 5307 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-27 22:19:50,499 INFO L231 Difference]: Finished difference. Result has 172 places, 373 transitions, 4652 flow [2024-06-27 22:19:50,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4211, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4652, PETRI_PLACES=172, PETRI_TRANSITIONS=373} [2024-06-27 22:19:50,500 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 116 predicate places. [2024-06-27 22:19:50,500 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 373 transitions, 4652 flow [2024-06-27 22:19:50,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:50,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:50,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:50,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:19:50,500 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:50,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1854827162, now seen corresponding path program 1 times [2024-06-27 22:19:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607849427] [2024-06-27 22:19:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607849427] [2024-06-27 22:19:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607849427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:19:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907551014] [2024-06-27 22:19:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:50,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:19:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:19:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:19:50,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 50 [2024-06-27 22:19:50,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 373 transitions, 4652 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:50,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:50,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 50 [2024-06-27 22:19:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:51,177 INFO L124 PetriNetUnfolderBase]: 2087/4465 cut-off events. [2024-06-27 22:19:51,177 INFO L125 PetriNetUnfolderBase]: For 64484/65100 co-relation queries the response was YES. [2024-06-27 22:19:51,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19227 conditions, 4465 events. 2087/4465 cut-off events. For 64484/65100 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 36099 event pairs, 619 based on Foata normal form. 250/4270 useless extension candidates. Maximal degree in co-relation 19150. Up to 2047 conditions per place. [2024-06-27 22:19:51,231 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 107 selfloop transitions, 72 changer transitions 0/352 dead transitions. [2024-06-27 22:19:51,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 352 transitions, 4647 flow [2024-06-27 22:19:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:19:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:19:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-06-27 22:19:51,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-06-27 22:19:51,232 INFO L175 Difference]: Start difference. First operand has 172 places, 373 transitions, 4652 flow. Second operand 3 states and 115 transitions. [2024-06-27 22:19:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 352 transitions, 4647 flow [2024-06-27 22:19:51,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 352 transitions, 4399 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-27 22:19:51,351 INFO L231 Difference]: Finished difference. Result has 165 places, 344 transitions, 4147 flow [2024-06-27 22:19:51,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4003, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4147, PETRI_PLACES=165, PETRI_TRANSITIONS=344} [2024-06-27 22:19:51,352 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-27 22:19:51,352 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 344 transitions, 4147 flow [2024-06-27 22:19:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:51,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:51,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:51,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:19:51,353 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:51,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -94126660, now seen corresponding path program 6 times [2024-06-27 22:19:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342373097] [2024-06-27 22:19:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342373097] [2024-06-27 22:19:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342373097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119361325] [2024-06-27 22:19:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:53,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:53,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 344 transitions, 4147 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:53,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:53,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:53,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:55,149 INFO L124 PetriNetUnfolderBase]: 5825/9451 cut-off events. [2024-06-27 22:19:55,149 INFO L125 PetriNetUnfolderBase]: For 122153/122155 co-relation queries the response was YES. [2024-06-27 22:19:55,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45730 conditions, 9451 events. 5825/9451 cut-off events. For 122153/122155 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 61297 event pairs, 2136 based on Foata normal form. 3/9201 useless extension candidates. Maximal degree in co-relation 45654. Up to 7639 conditions per place. [2024-06-27 22:19:55,217 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 190 selfloop transitions, 224 changer transitions 1/426 dead transitions. [2024-06-27 22:19:55,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 426 transitions, 5865 flow [2024-06-27 22:19:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:19:55,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425 [2024-06-27 22:19:55,219 INFO L175 Difference]: Start difference. First operand has 165 places, 344 transitions, 4147 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:19:55,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 426 transitions, 5865 flow [2024-06-27 22:19:55,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 426 transitions, 5703 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:55,451 INFO L231 Difference]: Finished difference. Result has 172 places, 378 transitions, 4933 flow [2024-06-27 22:19:55,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4003, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4933, PETRI_PLACES=172, PETRI_TRANSITIONS=378} [2024-06-27 22:19:55,452 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 116 predicate places. [2024-06-27 22:19:55,452 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 378 transitions, 4933 flow [2024-06-27 22:19:55,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:55,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:55,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:55,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:19:55,453 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:55,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 743539290, now seen corresponding path program 7 times [2024-06-27 22:19:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465902293] [2024-06-27 22:19:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465902293] [2024-06-27 22:19:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465902293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:57,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:57,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:19:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469383535] [2024-06-27 22:19:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:57,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:19:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:57,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:19:57,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:19:57,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:19:57,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 378 transitions, 4933 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:57,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:57,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:19:57,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:59,009 INFO L124 PetriNetUnfolderBase]: 5190/8565 cut-off events. [2024-06-27 22:19:59,010 INFO L125 PetriNetUnfolderBase]: For 123424/123426 co-relation queries the response was YES. [2024-06-27 22:19:59,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43219 conditions, 8565 events. 5190/8565 cut-off events. For 123424/123426 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 55951 event pairs, 1779 based on Foata normal form. 3/8350 useless extension candidates. Maximal degree in co-relation 43139. Up to 6755 conditions per place. [2024-06-27 22:19:59,086 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 189 selfloop transitions, 219 changer transitions 0/419 dead transitions. [2024-06-27 22:19:59,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 419 transitions, 6073 flow [2024-06-27 22:19:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:19:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:19:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-27 22:19:59,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-27 22:19:59,088 INFO L175 Difference]: Start difference. First operand has 172 places, 378 transitions, 4933 flow. Second operand 8 states and 215 transitions. [2024-06-27 22:19:59,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 419 transitions, 6073 flow [2024-06-27 22:19:59,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 419 transitions, 5762 flow, removed 54 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:59,371 INFO L231 Difference]: Finished difference. Result has 177 places, 378 transitions, 5080 flow [2024-06-27 22:19:59,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5080, PETRI_PLACES=177, PETRI_TRANSITIONS=378} [2024-06-27 22:19:59,371 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 121 predicate places. [2024-06-27 22:19:59,372 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 378 transitions, 5080 flow [2024-06-27 22:19:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:59,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:59,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:59,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:19:59,372 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:59,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1641048671, now seen corresponding path program 3 times [2024-06-27 22:19:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171871557] [2024-06-27 22:19:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:00,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-27 22:20:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171871557] [2024-06-27 22:20:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171871557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897014068] [2024-06-27 22:20:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:00,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:00,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:01,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:01,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 378 transitions, 5080 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:01,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:01,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:01,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:02,672 INFO L124 PetriNetUnfolderBase]: 5222/8609 cut-off events. [2024-06-27 22:20:02,673 INFO L125 PetriNetUnfolderBase]: For 134445/134449 co-relation queries the response was YES. [2024-06-27 22:20:02,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43717 conditions, 8609 events. 5222/8609 cut-off events. For 134445/134449 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 56291 event pairs, 2214 based on Foata normal form. 7/8404 useless extension candidates. Maximal degree in co-relation 43634. Up to 7118 conditions per place. [2024-06-27 22:20:02,755 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 296 selfloop transitions, 116 changer transitions 0/423 dead transitions. [2024-06-27 22:20:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 423 transitions, 6296 flow [2024-06-27 22:20:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 22:20:02,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175 [2024-06-27 22:20:02,757 INFO L175 Difference]: Start difference. First operand has 177 places, 378 transitions, 5080 flow. Second operand 8 states and 207 transitions. [2024-06-27 22:20:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 423 transitions, 6296 flow [2024-06-27 22:20:03,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 423 transitions, 5819 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:03,063 INFO L231 Difference]: Finished difference. Result has 180 places, 386 transitions, 4954 flow [2024-06-27 22:20:03,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4603, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4954, PETRI_PLACES=180, PETRI_TRANSITIONS=386} [2024-06-27 22:20:03,063 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 124 predicate places. [2024-06-27 22:20:03,064 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 386 transitions, 4954 flow [2024-06-27 22:20:03,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:03,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:03,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:03,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:20:03,064 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:03,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1947006344, now seen corresponding path program 8 times [2024-06-27 22:20:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:03,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886522147] [2024-06-27 22:20:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886522147] [2024-06-27 22:20:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886522147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132125584] [2024-06-27 22:20:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:04,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:04,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 386 transitions, 4954 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:04,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:04,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:06,398 INFO L124 PetriNetUnfolderBase]: 5254/8652 cut-off events. [2024-06-27 22:20:06,398 INFO L125 PetriNetUnfolderBase]: For 137096/137096 co-relation queries the response was YES. [2024-06-27 22:20:06,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43903 conditions, 8652 events. 5254/8652 cut-off events. For 137096/137096 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 56378 event pairs, 1709 based on Foata normal form. 3/8440 useless extension candidates. Maximal degree in co-relation 43817. Up to 6833 conditions per place. [2024-06-27 22:20:06,486 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 181 selfloop transitions, 245 changer transitions 0/437 dead transitions. [2024-06-27 22:20:06,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 437 transitions, 6320 flow [2024-06-27 22:20:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:20:06,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:20:06,489 INFO L175 Difference]: Start difference. First operand has 180 places, 386 transitions, 4954 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:20:06,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 437 transitions, 6320 flow [2024-06-27 22:20:06,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 437 transitions, 6110 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:06,819 INFO L231 Difference]: Finished difference. Result has 185 places, 397 transitions, 5520 flow [2024-06-27 22:20:06,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4744, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5520, PETRI_PLACES=185, PETRI_TRANSITIONS=397} [2024-06-27 22:20:06,820 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 129 predicate places. [2024-06-27 22:20:06,820 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 397 transitions, 5520 flow [2024-06-27 22:20:06,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:06,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:06,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:06,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:20:06,821 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:06,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1947006561, now seen corresponding path program 4 times [2024-06-27 22:20:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117490132] [2024-06-27 22:20:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117490132] [2024-06-27 22:20:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117490132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023268513] [2024-06-27 22:20:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:08,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:08,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:08,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 397 transitions, 5520 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:08,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:08,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:08,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:10,452 INFO L124 PetriNetUnfolderBase]: 5286/8709 cut-off events. [2024-06-27 22:20:10,453 INFO L125 PetriNetUnfolderBase]: For 149593/149597 co-relation queries the response was YES. [2024-06-27 22:20:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45226 conditions, 8709 events. 5286/8709 cut-off events. For 149593/149597 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 56907 event pairs, 2214 based on Foata normal form. 7/8504 useless extension candidates. Maximal degree in co-relation 45136. Up to 7196 conditions per place. [2024-06-27 22:20:10,524 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 316 selfloop transitions, 118 changer transitions 0/445 dead transitions. [2024-06-27 22:20:10,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 445 transitions, 6806 flow [2024-06-27 22:20:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:20:10,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 22:20:10,539 INFO L175 Difference]: Start difference. First operand has 185 places, 397 transitions, 5520 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:20:10,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 445 transitions, 6806 flow [2024-06-27 22:20:10,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 445 transitions, 6449 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:10,851 INFO L231 Difference]: Finished difference. Result has 188 places, 405 transitions, 5507 flow [2024-06-27 22:20:10,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5163, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5507, PETRI_PLACES=188, PETRI_TRANSITIONS=405} [2024-06-27 22:20:10,852 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 132 predicate places. [2024-06-27 22:20:10,852 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 405 transitions, 5507 flow [2024-06-27 22:20:10,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:10,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:10,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:10,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:20:10,853 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:10,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1792182486, now seen corresponding path program 9 times [2024-06-27 22:20:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578115424] [2024-06-27 22:20:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578115424] [2024-06-27 22:20:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578115424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148008344] [2024-06-27 22:20:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:12,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:12,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:12,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:12,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 405 transitions, 5507 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:12,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:12,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:12,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:14,318 INFO L124 PetriNetUnfolderBase]: 5318/8748 cut-off events. [2024-06-27 22:20:14,319 INFO L125 PetriNetUnfolderBase]: For 154811/154811 co-relation queries the response was YES. [2024-06-27 22:20:14,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45411 conditions, 8748 events. 5318/8748 cut-off events. For 154811/154811 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 56929 event pairs, 1723 based on Foata normal form. 3/8536 useless extension candidates. Maximal degree in co-relation 45319. Up to 6911 conditions per place. [2024-06-27 22:20:14,394 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 206 selfloop transitions, 237 changer transitions 0/454 dead transitions. [2024-06-27 22:20:14,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 454 transitions, 6875 flow [2024-06-27 22:20:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:20:14,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 22:20:14,396 INFO L175 Difference]: Start difference. First operand has 188 places, 405 transitions, 5507 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:20:14,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 454 transitions, 6875 flow [2024-06-27 22:20:14,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 454 transitions, 6675 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:14,763 INFO L231 Difference]: Finished difference. Result has 192 places, 413 transitions, 5921 flow [2024-06-27 22:20:14,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5307, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5921, PETRI_PLACES=192, PETRI_TRANSITIONS=413} [2024-06-27 22:20:14,764 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 136 predicate places. [2024-06-27 22:20:14,764 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 413 transitions, 5921 flow [2024-06-27 22:20:14,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:14,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:14,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:14,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:20:14,764 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:14,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1939649114, now seen corresponding path program 10 times [2024-06-27 22:20:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800628090] [2024-06-27 22:20:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:16,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-27 22:20:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800628090] [2024-06-27 22:20:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800628090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130551609] [2024-06-27 22:20:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:16,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:16,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 413 transitions, 5921 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:16,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:16,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:16,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:18,181 INFO L124 PetriNetUnfolderBase]: 5310/8739 cut-off events. [2024-06-27 22:20:18,182 INFO L125 PetriNetUnfolderBase]: For 163780/163780 co-relation queries the response was YES. [2024-06-27 22:20:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45945 conditions, 8739 events. 5310/8739 cut-off events. For 163780/163780 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 56883 event pairs, 1726 based on Foata normal form. 3/8527 useless extension candidates. Maximal degree in co-relation 45850. Up to 6903 conditions per place. [2024-06-27 22:20:18,267 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 197 selfloop transitions, 240 changer transitions 0/448 dead transitions. [2024-06-27 22:20:18,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 448 transitions, 6991 flow [2024-06-27 22:20:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:20:18,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225 [2024-06-27 22:20:18,268 INFO L175 Difference]: Start difference. First operand has 192 places, 413 transitions, 5921 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:20:18,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 448 transitions, 6991 flow [2024-06-27 22:20:18,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 448 transitions, 6411 flow, removed 82 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:18,667 INFO L231 Difference]: Finished difference. Result has 196 places, 413 transitions, 5836 flow [2024-06-27 22:20:18,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5341, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5836, PETRI_PLACES=196, PETRI_TRANSITIONS=413} [2024-06-27 22:20:18,668 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 140 predicate places. [2024-06-27 22:20:18,668 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 413 transitions, 5836 flow [2024-06-27 22:20:18,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:18,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:18,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:18,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:20:18,669 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:18,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1939654911, now seen corresponding path program 5 times [2024-06-27 22:20:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763362380] [2024-06-27 22:20:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763362380] [2024-06-27 22:20:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763362380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:20,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:20,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:20,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662206076] [2024-06-27 22:20:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:20,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:20,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:20,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:20,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 413 transitions, 5836 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:20,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:20,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:20,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:22,071 INFO L124 PetriNetUnfolderBase]: 5302/8734 cut-off events. [2024-06-27 22:20:22,075 INFO L125 PetriNetUnfolderBase]: For 171819/171823 co-relation queries the response was YES. [2024-06-27 22:20:22,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45856 conditions, 8734 events. 5302/8734 cut-off events. For 171819/171823 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 57125 event pairs, 2228 based on Foata normal form. 7/8529 useless extension candidates. Maximal degree in co-relation 45758. Up to 7221 conditions per place. [2024-06-27 22:20:22,167 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 324 selfloop transitions, 115 changer transitions 0/450 dead transitions. [2024-06-27 22:20:22,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 450 transitions, 6920 flow [2024-06-27 22:20:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 22:20:22,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175 [2024-06-27 22:20:22,169 INFO L175 Difference]: Start difference. First operand has 196 places, 413 transitions, 5836 flow. Second operand 8 states and 207 transitions. [2024-06-27 22:20:22,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 450 transitions, 6920 flow [2024-06-27 22:20:22,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 450 transitions, 6256 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:22,493 INFO L231 Difference]: Finished difference. Result has 198 places, 413 transitions, 5418 flow [2024-06-27 22:20:22,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5172, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5418, PETRI_PLACES=198, PETRI_TRANSITIONS=413} [2024-06-27 22:20:22,494 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 142 predicate places. [2024-06-27 22:20:22,494 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 413 transitions, 5418 flow [2024-06-27 22:20:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:22,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:22,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:22,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:20:22,495 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:22,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1352036497, now seen corresponding path program 1 times [2024-06-27 22:20:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796054146] [2024-06-27 22:20:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796054146] [2024-06-27 22:20:23,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796054146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177143332] [2024-06-27 22:20:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:23,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:23,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:20:23,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 413 transitions, 5418 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:23,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:23,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:20:23,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:24,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L775-->L791: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd2~0_46 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd2~0_46 256) 0))) (let ((.cse5 (not .cse3)) (.cse6 (and (= (mod v_~z$w_buff1_used~0_53 256) 0) .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_58 256) 0)) (.cse4 (and .cse10 .cse3))) (let ((.cse7 (or .cse6 .cse11 .cse4)) (.cse8 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse2 (= (mod v_~z$w_buff1_used~0_52 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_57 256) 0))) (and (= (ite .cse0 v_~z$mem_tmp~0_26 v_~__unbuffered_p1_EBX~0_24) v_~z~0_52) (= v_~z$mem_tmp~0_26 v_~z~0_53) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd2~0_45 (ite .cse0 v_~z$r_buff0_thd2~0_46 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~z$r_buff0_thd2~0_46 (ite (and .cse5 (not .cse1)) 0 v_~z$r_buff0_thd2~0_46)))) (or (= v_~weak$$choice0~0_19 1) (= v_~weak$$choice0~0_19 0)) (= v_~z$w_buff1~0_33 v_~z$w_buff1~0_32) (= v_~z$flush_delayed~0_39 0) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= (ite .cse0 v_~z$w_buff1_used~0_53 (ite (or .cse6 .cse1 .cse4) v_~z$w_buff1_used~0_53 0)) v_~z$w_buff1_used~0_52) (= v_~z$w_buff0_used~0_57 (ite .cse0 v_~z$w_buff0_used~0_58 (ite .cse7 v_~z$w_buff0_used~0_58 (ite .cse8 0 v_~z$w_buff0_used~0_58)))) (= v_~__unbuffered_p1_EBX~0_24 (ite .cse7 v_~z~0_53 (ite .cse8 v_~z$w_buff0~0_34 v_~z$w_buff1~0_33))) (= (ite .cse0 v_~z$r_buff1_thd2~0_46 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd2~0_45 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~z$r_buff1_thd2~0_46 0)) v_~z$r_buff1_thd2~0_45))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_46, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_53, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_46} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_33, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_45, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~z~0=v_~z~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][146], [Black: 248#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (= ~b~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= (div ~z$r_buff0_thd3~0 256) (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (<= ~z$w_buff1_used~0 ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 250#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (or (and (= 0 ~z$flush_delayed~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 123#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 133#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 516#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 268#(and (= ~z$r_buff0_thd3~0 1) (or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~b~0 0) (<= ~z$r_buff1_thd3~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 397#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 148#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), 272#true, Black: 535#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 281#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 117#true, Black: 425#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), 27#L757true, Black: 554#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 291#true, 241#true, 85#true, 545#true, P2Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 180#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), Black: 439#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 157#true, Black: 322#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), 50#$Ultimate##0true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 83#(and (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 7#L851true, Black: 347#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), 330#true, Black: 333#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 481#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 71#true, 564#true, 5#L791true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 497#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0))]) [2024-06-27 22:20:24,155 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 22:20:24,155 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:20:24,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:20:24,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:20:24,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L801-->L812: Formula: (and (= v_~z$r_buff0_thd0~0_63 v_~z$r_buff1_thd0~0_61) (= v_~z$r_buff0_thd3~0_80 1) (= v_~z$w_buff0~0_80 v_~z$w_buff1~0_78) (= v_~z$r_buff0_thd1~0_43 v_~z$r_buff1_thd1~0_45) (= v_~z$w_buff0_used~0_135 1) (= v_~z$w_buff0~0_79 1) (not (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_122 256) 0)) (not (= (mod v_~z$w_buff0_used~0_135 256) 0)))) 1 0) 0)) (= v_~z$r_buff0_thd3~0_81 v_~z$r_buff1_thd3~0_59) (= v_~z$w_buff0_used~0_136 v_~z$w_buff1_used~0_122) (= v_~z$r_buff0_thd2~0_91 v_~z$r_buff1_thd2~0_85)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_63, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_43, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_91} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_85, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_122, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_63, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_43, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][258], [Black: 248#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (= ~b~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= (div ~z$r_buff0_thd3~0 256) (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (<= ~z$w_buff1_used~0 ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)), Black: 250#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (or (and (= 0 ~z$flush_delayed~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 123#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 133#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 516#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 54#L775true, Black: 268#(and (= ~z$r_buff0_thd3~0 1) (or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~b~0 0) (<= ~z$r_buff1_thd3~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 397#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 148#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), 272#true, Black: 535#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 281#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 117#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 425#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), 27#L757true, Black: 554#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 291#true, 241#true, 85#true, 545#true, P2Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 180#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), Black: 439#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 157#true, Black: 322#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 83#(and (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 7#L851true, 22#L812true, Black: 347#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), 330#true, Black: 333#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 481#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 71#true, 564#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 497#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0))]) [2024-06-27 22:20:24,216 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 22:20:24,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:20:24,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:20:24,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:20:24,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L851-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (let ((.cse5 (mod v_~z$r_buff1_thd1~0_7 256)) (.cse7 (mod v_~z$read_delayed~0_6 256)) (.cse0 (mod v_~z$r_buff1_thd2~0_15 256)) (.cse9 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse8 (mod v_~z$r_buff0_thd1~0_7 256)) (.cse1 (mod v_~z$r_buff1_thd3~0_11 256)) (.cse10 (mod v_~z$r_buff0_thd0~0_7 256)) (.cse2 (mod v_~z$w_buff1_used~0_20 256)) (.cse6 (mod v_~z$r_buff0_thd3~0_14 256)) (.cse4 (mod v_~z$w_buff0_used~0_23 256)) (.cse11 (mod v_~z$flush_delayed~0_9 256)) (.cse3 (mod v_~z$r_buff0_thd2~0_15 256))) (or (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse0)) (< (+ .cse1 1) v_~__unbuffered_p2_EBX~0_7) (< .cse1 .cse2) (< v_~z$w_buff1~0_11 .cse2) (< (+ .cse3 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~a~0_8 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse4 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse5 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_p2_EBX~0_7) (< (+ (mod v_~main$tmp_guard1~0_6 256) 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~__unbuffered_p2_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~__unbuffered_p1_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z~0_14 v_~z$mem_tmp~0_8) (< (+ v_~z$mem_tmp~0_8 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z$w_buff0~0_12 v_~__unbuffered_p1_EBX~0_7) (< .cse4 .cse2) (< .cse1 v_~z$w_buff1~0_11) (< .cse6 v_~__unbuffered_p1_EBX~0_7) (< v_~z$w_buff0~0_12 .cse4) (< (+ v_~__unbuffered_p0_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~y~0_8 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~z$w_buff1~0_11 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z$w_buff0~0_12 .cse1) (< v_~z$w_buff1~0_11 .cse1) (< (+ .cse7 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z$w_buff0~0_12 v_~z$mem_tmp~0_8) (< (+ (mod v_~weak$$choice2~0_14 256) 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~x~0_8 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~z$w_buff0~0_12 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse8 1) v_~__unbuffered_p2_EBX~0_7) (< .cse6 .cse2) (< .cse6 v_~z$w_buff0~0_12) (< 1 (+ .cse5 v_~__unbuffered_p2_EBX~0_7)) (< .cse6 v_~z$mem_tmp~0_8) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse9)) (< (+ v_~z~0_14 1) v_~__unbuffered_p2_EBX~0_7) (< v_~b~0_8 v_~__unbuffered_p2_EBX~0_7) (< v_~y~0_8 v_~__unbuffered_p1_EAX~0_7) (< v_~z$w_buff0~0_12 v_~z~0_14) (< v_~z$w_buff0~0_12 v_~z$w_buff1~0_11) (< 1 (+ .cse7 v_~__unbuffered_p2_EBX~0_7)) (< (+ v_~__unbuffered_p1_EBX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse10)) (< (+ .cse0 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse9 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z~0_14 v_~__unbuffered_p1_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse8)) (< .cse6 .cse1) (< v_~a~0_8 v_~__unbuffered_p2_EAX~0_7) (< v_~z$w_buff0~0_12 .cse6) (< (+ .cse6 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse10 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse11)) (< .cse6 v_~z$w_buff1~0_11) (< v_~x~0_8 v_~__unbuffered_p0_EAX~0_7) (< .cse6 v_~z~0_14) (< (+ (mod v_~weak$$choice0~0_7 256) 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z$w_buff0~0_12 .cse2) (< (+ .cse2 1) v_~__unbuffered_p2_EBX~0_7) (< v_~__unbuffered_p1_EBX~0_7 v_~z$mem_tmp~0_8) (< 2 (+ v_~__unbuffered_p2_EBX~0_7 v_~b~0_8)) (< v_~z$mem_tmp~0_8 v_~__unbuffered_p1_EBX~0_7) (< .cse6 .cse4) (< (+ .cse11 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse3)))) (not (= |v_#ghost~multithreaded_7| 0))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~a~0=v_~a~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_20, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_8, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_8} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~a~0=v_~a~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_20, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_8, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[][207], [Black: 248#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (= ~b~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= (div ~z$r_buff0_thd3~0 256) (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (<= ~z$w_buff1_used~0 ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)), Black: 250#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (or (and (= 0 ~z$flush_delayed~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 123#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 133#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 516#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 54#L775true, Black: 268#(and (= ~z$r_buff0_thd3~0 1) (or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~b~0 0) (<= ~z$r_buff1_thd3~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 397#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 148#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), 272#true, Black: 535#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 281#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 117#true, Black: 425#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), 27#L757true, Black: 554#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 291#true, 241#true, 85#true, 545#true, P2Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 180#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), Black: 439#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 157#true, Black: 322#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), 50#$Ultimate##0true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 83#(and (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 345#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), 330#true, Black: 333#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 481#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 71#true, 564#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), 17#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 368#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 497#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0))]) [2024-06-27 22:20:24,222 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-27 22:20:24,222 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-27 22:20:24,222 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-27 22:20:24,222 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-27 22:20:24,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L759-->L762: 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][145], [Black: 248#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (= ~b~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= (div ~z$r_buff0_thd3~0 256) (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (<= ~z$w_buff1_used~0 ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= ~z$r_buff1_thd2~0 0) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)), Black: 250#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (or (and (= 0 ~z$flush_delayed~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 373#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 258#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 123#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 133#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~x~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 516#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 54#L775true, Black: 268#(and (= ~z$r_buff0_thd3~0 1) (or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~b~0 0) (<= ~z$r_buff1_thd3~0 0) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 397#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 148#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), 272#true, Black: 535#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 281#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 117#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 425#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 419#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 554#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 291#true, 85#true, 545#true, 241#true, 28#L762true, P2Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 180#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))), Black: 439#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (= ~b~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~x~0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 157#true, Black: 322#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p2_EAX~0 ~a~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)), 50#$Ultimate##0true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 83#(and (= 0 ~z$flush_delayed~0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1_used~0 0) (<= 0 ~__unbuffered_p0_EAX~0) (<= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p0_EAX~0 ~x~0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 7#L851true, Black: 347#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), 330#true, Black: 345#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 333#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 477#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 481#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), 71#true, 564#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (<= 0 ~z$w_buff0~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~b~0 1) (<= 0 ~z$w_buff0~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (= ~b~0 0) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0))) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0)), Black: 497#(and (= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_p2_EAX~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$w_buff1_used~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$w_buff1_used~0 256)))) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~b~0 1) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1) (= (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (<= ~__unbuffered_p2_EAX~0 ~a~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= 0 ~z$w_buff0~0))]) [2024-06-27 22:20:24,279 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-27 22:20:24,279 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:20:24,279 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:20:24,279 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:20:25,091 INFO L124 PetriNetUnfolderBase]: 5506/9091 cut-off events. [2024-06-27 22:20:25,092 INFO L125 PetriNetUnfolderBase]: For 214679/214854 co-relation queries the response was YES. [2024-06-27 22:20:25,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47937 conditions, 9091 events. 5506/9091 cut-off events. For 214679/214854 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 60565 event pairs, 2686 based on Foata normal form. 72/8827 useless extension candidates. Maximal degree in co-relation 47836. Up to 7630 conditions per place. [2024-06-27 22:20:25,183 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 352 selfloop transitions, 19 changer transitions 0/431 dead transitions. [2024-06-27 22:20:25,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 431 transitions, 6268 flow [2024-06-27 22:20:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:20:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:20:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-27 22:20:25,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:20:25,185 INFO L175 Difference]: Start difference. First operand has 198 places, 413 transitions, 5418 flow. Second operand 6 states and 150 transitions. [2024-06-27 22:20:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 431 transitions, 6268 flow [2024-06-27 22:20:25,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 431 transitions, 6077 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:25,482 INFO L231 Difference]: Finished difference. Result has 198 places, 417 transitions, 5324 flow [2024-06-27 22:20:25,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5227, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5324, PETRI_PLACES=198, PETRI_TRANSITIONS=417} [2024-06-27 22:20:25,482 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 142 predicate places. [2024-06-27 22:20:25,482 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 417 transitions, 5324 flow [2024-06-27 22:20:25,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:25,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:25,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:25,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:20:25,483 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:25,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash -597746965, now seen corresponding path program 1 times [2024-06-27 22:20:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008073770] [2024-06-27 22:20:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008073770] [2024-06-27 22:20:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008073770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236060432] [2024-06-27 22:20:26,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:26,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:26,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:26,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:26,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:20:26,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 417 transitions, 5324 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:26,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:26,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:20:26,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:28,674 INFO L124 PetriNetUnfolderBase]: 5326/9047 cut-off events. [2024-06-27 22:20:28,674 INFO L125 PetriNetUnfolderBase]: For 208178/208195 co-relation queries the response was YES. [2024-06-27 22:20:28,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47987 conditions, 9047 events. 5326/9047 cut-off events. For 208178/208195 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 61794 event pairs, 2262 based on Foata normal form. 9/8772 useless extension candidates. Maximal degree in co-relation 47885. Up to 7152 conditions per place. [2024-06-27 22:20:28,771 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 322 selfloop transitions, 112 changer transitions 0/481 dead transitions. [2024-06-27 22:20:28,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 481 transitions, 6504 flow [2024-06-27 22:20:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:20:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:20:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 337 transitions. [2024-06-27 22:20:28,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184615384615384 [2024-06-27 22:20:28,778 INFO L175 Difference]: Start difference. First operand has 198 places, 417 transitions, 5324 flow. Second operand 13 states and 337 transitions. [2024-06-27 22:20:28,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 481 transitions, 6504 flow [2024-06-27 22:20:29,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 481 transitions, 6439 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:29,079 INFO L231 Difference]: Finished difference. Result has 207 places, 420 transitions, 5556 flow [2024-06-27 22:20:29,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5556, PETRI_PLACES=207, PETRI_TRANSITIONS=420} [2024-06-27 22:20:29,080 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 151 predicate places. [2024-06-27 22:20:29,080 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 420 transitions, 5556 flow [2024-06-27 22:20:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:29,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:29,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:29,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:20:29,080 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:29,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1209060565, now seen corresponding path program 1 times [2024-06-27 22:20:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795285559] [2024-06-27 22:20:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795285559] [2024-06-27 22:20:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795285559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:30,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175236831] [2024-06-27 22:20:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:31,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:31,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 420 transitions, 5556 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:31,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:31,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:31,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:32,759 INFO L124 PetriNetUnfolderBase]: 5593/9354 cut-off events. [2024-06-27 22:20:32,759 INFO L125 PetriNetUnfolderBase]: For 221263/221265 co-relation queries the response was YES. [2024-06-27 22:20:32,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50938 conditions, 9354 events. 5593/9354 cut-off events. For 221263/221265 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 62539 event pairs, 2044 based on Foata normal form. 4/9080 useless extension candidates. Maximal degree in co-relation 50835. Up to 7677 conditions per place. [2024-06-27 22:20:32,842 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 350 selfloop transitions, 105 changer transitions 0/467 dead transitions. [2024-06-27 22:20:32,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 467 transitions, 6706 flow [2024-06-27 22:20:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-06-27 22:20:32,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508 [2024-06-27 22:20:32,851 INFO L175 Difference]: Start difference. First operand has 207 places, 420 transitions, 5556 flow. Second operand 10 states and 254 transitions. [2024-06-27 22:20:32,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 467 transitions, 6706 flow [2024-06-27 22:20:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 467 transitions, 6439 flow, removed 25 selfloop flow, removed 11 redundant places. [2024-06-27 22:20:33,150 INFO L231 Difference]: Finished difference. Result has 206 places, 424 transitions, 5581 flow [2024-06-27 22:20:33,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5289, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5581, PETRI_PLACES=206, PETRI_TRANSITIONS=424} [2024-06-27 22:20:33,151 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 150 predicate places. [2024-06-27 22:20:33,151 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 424 transitions, 5581 flow [2024-06-27 22:20:33,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:33,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:33,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:33,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:20:33,152 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:33,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -600603925, now seen corresponding path program 2 times [2024-06-27 22:20:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729437747] [2024-06-27 22:20:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729437747] [2024-06-27 22:20:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729437747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138646085] [2024-06-27 22:20:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:34,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:34,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:34,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:20:34,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 424 transitions, 5581 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:34,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:34,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:20:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:36,451 INFO L124 PetriNetUnfolderBase]: 5514/9217 cut-off events. [2024-06-27 22:20:36,452 INFO L125 PetriNetUnfolderBase]: For 259455/259558 co-relation queries the response was YES. [2024-06-27 22:20:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52713 conditions, 9217 events. 5514/9217 cut-off events. For 259455/259558 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 62262 event pairs, 2167 based on Foata normal form. 13/8892 useless extension candidates. Maximal degree in co-relation 52609. Up to 7311 conditions per place. [2024-06-27 22:20:36,538 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 331 selfloop transitions, 120 changer transitions 0/498 dead transitions. [2024-06-27 22:20:36,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 498 transitions, 6969 flow [2024-06-27 22:20:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:20:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:20:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 342 transitions. [2024-06-27 22:20:36,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261538461538462 [2024-06-27 22:20:36,540 INFO L175 Difference]: Start difference. First operand has 206 places, 424 transitions, 5581 flow. Second operand 13 states and 342 transitions. [2024-06-27 22:20:36,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 498 transitions, 6969 flow [2024-06-27 22:20:36,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 498 transitions, 6717 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 22:20:36,849 INFO L231 Difference]: Finished difference. Result has 212 places, 432 transitions, 5746 flow [2024-06-27 22:20:36,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5329, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5746, PETRI_PLACES=212, PETRI_TRANSITIONS=432} [2024-06-27 22:20:36,849 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 156 predicate places. [2024-06-27 22:20:36,849 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 432 transitions, 5746 flow [2024-06-27 22:20:36,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:36,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:36,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:36,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:20:36,850 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:36,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1098526563, now seen corresponding path program 2 times [2024-06-27 22:20:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505905992] [2024-06-27 22:20:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505905992] [2024-06-27 22:20:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505905992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098320991] [2024-06-27 22:20:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:38,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:38,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:38,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:38,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:38,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 432 transitions, 5746 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:38,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:38,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:38,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:40,700 INFO L124 PetriNetUnfolderBase]: 5768/9578 cut-off events. [2024-06-27 22:20:40,700 INFO L125 PetriNetUnfolderBase]: For 259827/259829 co-relation queries the response was YES. [2024-06-27 22:20:40,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55106 conditions, 9578 events. 5768/9578 cut-off events. For 259827/259829 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 63650 event pairs, 1886 based on Foata normal form. 2/9303 useless extension candidates. Maximal degree in co-relation 55000. Up to 7141 conditions per place. [2024-06-27 22:20:40,809 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 216 selfloop transitions, 282 changer transitions 0/510 dead transitions. [2024-06-27 22:20:40,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 510 transitions, 7890 flow [2024-06-27 22:20:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 22:20:40,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548 [2024-06-27 22:20:40,811 INFO L175 Difference]: Start difference. First operand has 212 places, 432 transitions, 5746 flow. Second operand 10 states and 274 transitions. [2024-06-27 22:20:40,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 510 transitions, 7890 flow [2024-06-27 22:20:41,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 510 transitions, 7671 flow, removed 41 selfloop flow, removed 9 redundant places. [2024-06-27 22:20:41,304 INFO L231 Difference]: Finished difference. Result has 214 places, 454 transitions, 6575 flow [2024-06-27 22:20:41,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5527, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6575, PETRI_PLACES=214, PETRI_TRANSITIONS=454} [2024-06-27 22:20:41,305 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 158 predicate places. [2024-06-27 22:20:41,305 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 454 transitions, 6575 flow [2024-06-27 22:20:41,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:41,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:41,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:20:41,306 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:41,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1133725777, now seen corresponding path program 3 times [2024-06-27 22:20:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512707590] [2024-06-27 22:20:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:42,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:42,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512707590] [2024-06-27 22:20:42,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512707590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:42,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290139904] [2024-06-27 22:20:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:42,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:42,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:42,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:42,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 22:20:42,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 454 transitions, 6575 flow. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:42,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:42,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 22:20:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:44,165 INFO L124 PetriNetUnfolderBase]: 4588/8132 cut-off events. [2024-06-27 22:20:44,166 INFO L125 PetriNetUnfolderBase]: For 266279/266483 co-relation queries the response was YES. [2024-06-27 22:20:44,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50229 conditions, 8132 events. 4588/8132 cut-off events. For 266279/266483 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 58048 event pairs, 1362 based on Foata normal form. 74/7881 useless extension candidates. Maximal degree in co-relation 50120. Up to 5712 conditions per place. [2024-06-27 22:20:44,261 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 302 selfloop transitions, 128 changer transitions 0/538 dead transitions. [2024-06-27 22:20:44,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 538 transitions, 8362 flow [2024-06-27 22:20:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 346 transitions. [2024-06-27 22:20:44,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2024-06-27 22:20:44,263 INFO L175 Difference]: Start difference. First operand has 214 places, 454 transitions, 6575 flow. Second operand 12 states and 346 transitions. [2024-06-27 22:20:44,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 538 transitions, 8362 flow [2024-06-27 22:20:44,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 538 transitions, 8197 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:44,781 INFO L231 Difference]: Finished difference. Result has 226 places, 479 transitions, 7340 flow [2024-06-27 22:20:44,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6440, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7340, PETRI_PLACES=226, PETRI_TRANSITIONS=479} [2024-06-27 22:20:44,793 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 170 predicate places. [2024-06-27 22:20:44,793 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 479 transitions, 7340 flow [2024-06-27 22:20:44,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:44,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:44,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:44,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:20:44,794 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:44,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 548336985, now seen corresponding path program 3 times [2024-06-27 22:20:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972878026] [2024-06-27 22:20:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:46,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972878026] [2024-06-27 22:20:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972878026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:46,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484828833] [2024-06-27 22:20:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:46,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:46,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:46,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:20:46,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:20:46,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 479 transitions, 7340 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:46,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:46,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:20:46,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:48,650 INFO L124 PetriNetUnfolderBase]: 5911/9825 cut-off events. [2024-06-27 22:20:48,651 INFO L125 PetriNetUnfolderBase]: For 318745/318747 co-relation queries the response was YES. [2024-06-27 22:20:48,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61376 conditions, 9825 events. 5911/9825 cut-off events. For 318745/318747 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 65644 event pairs, 2228 based on Foata normal form. 4/9547 useless extension candidates. Maximal degree in co-relation 61262. Up to 7934 conditions per place. [2024-06-27 22:20:48,770 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 383 selfloop transitions, 185 changer transitions 0/580 dead transitions. [2024-06-27 22:20:48,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 580 transitions, 9380 flow [2024-06-27 22:20:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 22:20:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 22:20:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 404 transitions. [2024-06-27 22:20:48,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2024-06-27 22:20:48,773 INFO L175 Difference]: Start difference. First operand has 226 places, 479 transitions, 7340 flow. Second operand 16 states and 404 transitions. [2024-06-27 22:20:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 580 transitions, 9380 flow [2024-06-27 22:20:49,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 580 transitions, 9008 flow, removed 177 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:49,590 INFO L231 Difference]: Finished difference. Result has 241 places, 499 transitions, 7715 flow [2024-06-27 22:20:49,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=6972, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7715, PETRI_PLACES=241, PETRI_TRANSITIONS=499} [2024-06-27 22:20:49,592 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 185 predicate places. [2024-06-27 22:20:49,592 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 499 transitions, 7715 flow [2024-06-27 22:20:49,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:49,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:49,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:20:49,593 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:49,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1209183635, now seen corresponding path program 4 times [2024-06-27 22:20:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080570987] [2024-06-27 22:20:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:51,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080570987] [2024-06-27 22:20:51,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080570987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:51,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:51,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335717412] [2024-06-27 22:20:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:51,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:51,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:51,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:20:51,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 499 transitions, 7715 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:51,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:51,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:20:51,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:53,302 INFO L124 PetriNetUnfolderBase]: 5941/9892 cut-off events. [2024-06-27 22:20:53,302 INFO L125 PetriNetUnfolderBase]: For 329582/329660 co-relation queries the response was YES. [2024-06-27 22:20:53,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63229 conditions, 9892 events. 5941/9892 cut-off events. For 329582/329660 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 66492 event pairs, 1840 based on Foata normal form. 26/9620 useless extension candidates. Maximal degree in co-relation 63111. Up to 7879 conditions per place. [2024-06-27 22:20:53,409 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 429 selfloop transitions, 114 changer transitions 0/590 dead transitions. [2024-06-27 22:20:53,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 590 transitions, 9721 flow [2024-06-27 22:20:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2024-06-27 22:20:53,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534 [2024-06-27 22:20:53,411 INFO L175 Difference]: Start difference. First operand has 241 places, 499 transitions, 7715 flow. Second operand 10 states and 267 transitions. [2024-06-27 22:20:53,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 590 transitions, 9721 flow [2024-06-27 22:20:53,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 590 transitions, 9262 flow, removed 40 selfloop flow, removed 14 redundant places. [2024-06-27 22:20:53,954 INFO L231 Difference]: Finished difference. Result has 238 places, 536 transitions, 8071 flow [2024-06-27 22:20:53,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7268, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8071, PETRI_PLACES=238, PETRI_TRANSITIONS=536} [2024-06-27 22:20:53,954 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 182 predicate places. [2024-06-27 22:20:53,954 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 536 transitions, 8071 flow [2024-06-27 22:20:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:53,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:53,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:20:53,955 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:53,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1209065525, now seen corresponding path program 5 times [2024-06-27 22:20:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704867813] [2024-06-27 22:20:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704867813] [2024-06-27 22:20:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704867813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901018865] [2024-06-27 22:20:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:55,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:20:55,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 536 transitions, 8071 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:55,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:55,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:20:55,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:57,657 INFO L124 PetriNetUnfolderBase]: 5923/9864 cut-off events. [2024-06-27 22:20:57,658 INFO L125 PetriNetUnfolderBase]: For 316358/316436 co-relation queries the response was YES. [2024-06-27 22:20:57,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62747 conditions, 9864 events. 5923/9864 cut-off events. For 316358/316436 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 66320 event pairs, 1873 based on Foata normal form. 28/9594 useless extension candidates. Maximal degree in co-relation 62629. Up to 8025 conditions per place. [2024-06-27 22:20:57,786 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 436 selfloop transitions, 89 changer transitions 0/572 dead transitions. [2024-06-27 22:20:57,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 572 transitions, 9285 flow [2024-06-27 22:20:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-27 22:20:57,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2024-06-27 22:20:57,789 INFO L175 Difference]: Start difference. First operand has 238 places, 536 transitions, 8071 flow. Second operand 9 states and 238 transitions. [2024-06-27 22:20:57,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 572 transitions, 9285 flow [2024-06-27 22:20:58,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 572 transitions, 9039 flow, removed 77 selfloop flow, removed 6 redundant places. [2024-06-27 22:20:58,378 INFO L231 Difference]: Finished difference. Result has 241 places, 532 transitions, 7973 flow [2024-06-27 22:20:58,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7771, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7973, PETRI_PLACES=241, PETRI_TRANSITIONS=532} [2024-06-27 22:20:58,378 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 185 predicate places. [2024-06-27 22:20:58,378 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 532 transitions, 7973 flow [2024-06-27 22:20:58,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:58,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:58,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:20:58,379 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:58,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1093596415, now seen corresponding path program 4 times [2024-06-27 22:20:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305695393] [2024-06-27 22:20:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:59,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305695393] [2024-06-27 22:20:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305695393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:59,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:59,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:20:59,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523690612] [2024-06-27 22:20:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:59,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:20:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:20:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:00,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:00,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 532 transitions, 7973 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:00,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:00,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:02,460 INFO L124 PetriNetUnfolderBase]: 6208/10233 cut-off events. [2024-06-27 22:21:02,460 INFO L125 PetriNetUnfolderBase]: For 320010/320012 co-relation queries the response was YES. [2024-06-27 22:21:02,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64501 conditions, 10233 events. 6208/10233 cut-off events. For 320010/320012 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67880 event pairs, 1941 based on Foata normal form. 2/9958 useless extension candidates. Maximal degree in co-relation 64381. Up to 7752 conditions per place. [2024-06-27 22:21:02,558 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 266 selfloop transitions, 312 changer transitions 0/590 dead transitions. [2024-06-27 22:21:02,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 590 transitions, 9917 flow [2024-06-27 22:21:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-06-27 22:21:02,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.542 [2024-06-27 22:21:02,562 INFO L175 Difference]: Start difference. First operand has 241 places, 532 transitions, 7973 flow. Second operand 10 states and 271 transitions. [2024-06-27 22:21:02,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 590 transitions, 9917 flow [2024-06-27 22:21:03,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 590 transitions, 9753 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:03,180 INFO L231 Difference]: Finished difference. Result has 244 places, 536 transitions, 8501 flow [2024-06-27 22:21:03,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7809, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8501, PETRI_PLACES=244, PETRI_TRANSITIONS=536} [2024-06-27 22:21:03,181 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 188 predicate places. [2024-06-27 22:21:03,181 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 536 transitions, 8501 flow [2024-06-27 22:21:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:03,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:03,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:03,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:21:03,182 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:03,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1093589905, now seen corresponding path program 5 times [2024-06-27 22:21:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204101130] [2024-06-27 22:21:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:04,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:04,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204101130] [2024-06-27 22:21:04,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204101130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:04,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603457775] [2024-06-27 22:21:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:04,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:05,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:05,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 536 transitions, 8501 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:05,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:05,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:05,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:07,315 INFO L124 PetriNetUnfolderBase]: 6203/10226 cut-off events. [2024-06-27 22:21:07,316 INFO L125 PetriNetUnfolderBase]: For 333090/333092 co-relation queries the response was YES. [2024-06-27 22:21:07,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65486 conditions, 10226 events. 6203/10226 cut-off events. For 333090/333092 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67860 event pairs, 1941 based on Foata normal form. 2/9951 useless extension candidates. Maximal degree in co-relation 65365. Up to 7747 conditions per place. [2024-06-27 22:21:07,433 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 254 selfloop transitions, 322 changer transitions 0/588 dead transitions. [2024-06-27 22:21:07,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 588 transitions, 10237 flow [2024-06-27 22:21:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions. [2024-06-27 22:21:07,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536 [2024-06-27 22:21:07,435 INFO L175 Difference]: Start difference. First operand has 244 places, 536 transitions, 8501 flow. Second operand 10 states and 268 transitions. [2024-06-27 22:21:07,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 588 transitions, 10237 flow [2024-06-27 22:21:08,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 588 transitions, 9724 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:08,078 INFO L231 Difference]: Finished difference. Result has 248 places, 536 transitions, 8642 flow [2024-06-27 22:21:08,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7988, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8642, PETRI_PLACES=248, PETRI_TRANSITIONS=536} [2024-06-27 22:21:08,079 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 192 predicate places. [2024-06-27 22:21:08,079 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 536 transitions, 8642 flow [2024-06-27 22:21:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:08,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:08,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:21:08,080 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:08,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1093589657, now seen corresponding path program 1 times [2024-06-27 22:21:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633450600] [2024-06-27 22:21:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633450600] [2024-06-27 22:21:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633450600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372932047] [2024-06-27 22:21:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:09,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:09,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 536 transitions, 8642 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:09,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:10,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:12,547 INFO L124 PetriNetUnfolderBase]: 6277/10342 cut-off events. [2024-06-27 22:21:12,547 INFO L125 PetriNetUnfolderBase]: For 353093/353097 co-relation queries the response was YES. [2024-06-27 22:21:12,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66542 conditions, 10342 events. 6277/10342 cut-off events. For 353093/353097 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 68723 event pairs, 2282 based on Foata normal form. 4/10085 useless extension candidates. Maximal degree in co-relation 66420. Up to 8357 conditions per place. [2024-06-27 22:21:12,652 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 497 selfloop transitions, 117 changer transitions 0/626 dead transitions. [2024-06-27 22:21:12,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 626 transitions, 10953 flow [2024-06-27 22:21:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 273 transitions. [2024-06-27 22:21:12,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546 [2024-06-27 22:21:12,653 INFO L175 Difference]: Start difference. First operand has 248 places, 536 transitions, 8642 flow. Second operand 10 states and 273 transitions. [2024-06-27 22:21:12,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 626 transitions, 10953 flow [2024-06-27 22:21:13,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 626 transitions, 10293 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-27 22:21:13,209 INFO L231 Difference]: Finished difference. Result has 254 places, 559 transitions, 8690 flow [2024-06-27 22:21:13,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7982, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8690, PETRI_PLACES=254, PETRI_TRANSITIONS=559} [2024-06-27 22:21:13,210 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 198 predicate places. [2024-06-27 22:21:13,211 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 559 transitions, 8690 flow [2024-06-27 22:21:13,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:13,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:13,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:13,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:21:13,211 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:13,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1477114033, now seen corresponding path program 1 times [2024-06-27 22:21:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295205403] [2024-06-27 22:21:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295205403] [2024-06-27 22:21:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295205403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:14,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:21:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124861039] [2024-06-27 22:21:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:14,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:21:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:21:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:21:14,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:21:14,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 559 transitions, 8690 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:14,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:14,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:21:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:16,419 INFO L124 PetriNetUnfolderBase]: 5834/9805 cut-off events. [2024-06-27 22:21:16,419 INFO L125 PetriNetUnfolderBase]: For 396299/396696 co-relation queries the response was YES. [2024-06-27 22:21:16,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66111 conditions, 9805 events. 5834/9805 cut-off events. For 396299/396696 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 66962 event pairs, 2140 based on Foata normal form. 199/9618 useless extension candidates. Maximal degree in co-relation 65983. Up to 7919 conditions per place. [2024-06-27 22:21:16,557 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 468 selfloop transitions, 53 changer transitions 0/591 dead transitions. [2024-06-27 22:21:16,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 591 transitions, 10021 flow [2024-06-27 22:21:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:21:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:21:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 22:21:16,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-27 22:21:16,559 INFO L175 Difference]: Start difference. First operand has 254 places, 559 transitions, 8690 flow. Second operand 7 states and 187 transitions. [2024-06-27 22:21:16,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 591 transitions, 10021 flow [2024-06-27 22:21:17,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 591 transitions, 9909 flow, removed 55 selfloop flow, removed 1 redundant places. [2024-06-27 22:21:17,263 INFO L231 Difference]: Finished difference. Result has 261 places, 567 transitions, 8877 flow [2024-06-27 22:21:17,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8578, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8877, PETRI_PLACES=261, PETRI_TRANSITIONS=567} [2024-06-27 22:21:17,264 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 205 predicate places. [2024-06-27 22:21:17,264 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 567 transitions, 8877 flow [2024-06-27 22:21:17,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:17,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:17,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:17,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:21:17,264 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:17,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1145670789, now seen corresponding path program 6 times [2024-06-27 22:21:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518635339] [2024-06-27 22:21:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518635339] [2024-06-27 22:21:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518635339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314321658] [2024-06-27 22:21:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:18,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:18,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:19,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:21:19,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 567 transitions, 8877 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:19,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:19,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:21:19,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:21,300 INFO L124 PetriNetUnfolderBase]: 6170/10421 cut-off events. [2024-06-27 22:21:21,300 INFO L125 PetriNetUnfolderBase]: For 386955/386962 co-relation queries the response was YES. [2024-06-27 22:21:21,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69777 conditions, 10421 events. 6170/10421 cut-off events. For 386955/386962 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 71778 event pairs, 1624 based on Foata normal form. 8/10136 useless extension candidates. Maximal degree in co-relation 69645. Up to 8332 conditions per place. [2024-06-27 22:21:21,437 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 476 selfloop transitions, 97 changer transitions 0/621 dead transitions. [2024-06-27 22:21:21,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 621 transitions, 10546 flow [2024-06-27 22:21:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-27 22:21:21,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2024-06-27 22:21:21,439 INFO L175 Difference]: Start difference. First operand has 261 places, 567 transitions, 8877 flow. Second operand 9 states and 228 transitions. [2024-06-27 22:21:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 621 transitions, 10546 flow [2024-06-27 22:21:22,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 621 transitions, 10437 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 22:21:22,262 INFO L231 Difference]: Finished difference. Result has 267 places, 586 transitions, 9336 flow [2024-06-27 22:21:22,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8746, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9336, PETRI_PLACES=267, PETRI_TRANSITIONS=586} [2024-06-27 22:21:22,263 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 211 predicate places. [2024-06-27 22:21:22,263 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 586 transitions, 9336 flow [2024-06-27 22:21:22,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:22,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:22,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:22,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:21:22,264 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:22,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1456729315, now seen corresponding path program 7 times [2024-06-27 22:21:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:22,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663373676] [2024-06-27 22:21:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:23,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663373676] [2024-06-27 22:21:23,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663373676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771160130] [2024-06-27 22:21:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:23,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:23,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:21:23,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 586 transitions, 9336 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:23,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:23,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:21:23,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:26,263 INFO L124 PetriNetUnfolderBase]: 6345/10680 cut-off events. [2024-06-27 22:21:26,264 INFO L125 PetriNetUnfolderBase]: For 400366/400366 co-relation queries the response was YES. [2024-06-27 22:21:26,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71673 conditions, 10680 events. 6345/10680 cut-off events. For 400366/400366 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 73591 event pairs, 1620 based on Foata normal form. 6/10393 useless extension candidates. Maximal degree in co-relation 71540. Up to 8357 conditions per place. [2024-06-27 22:21:26,413 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 475 selfloop transitions, 139 changer transitions 0/662 dead transitions. [2024-06-27 22:21:26,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 662 transitions, 11188 flow [2024-06-27 22:21:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2024-06-27 22:21:26,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 22:21:26,415 INFO L175 Difference]: Start difference. First operand has 267 places, 586 transitions, 9336 flow. Second operand 10 states and 255 transitions. [2024-06-27 22:21:26,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 662 transitions, 11188 flow [2024-06-27 22:21:27,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 662 transitions, 10880 flow, removed 58 selfloop flow, removed 9 redundant places. [2024-06-27 22:21:27,273 INFO L231 Difference]: Finished difference. Result has 269 places, 616 transitions, 9776 flow [2024-06-27 22:21:27,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=8984, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9776, PETRI_PLACES=269, PETRI_TRANSITIONS=616} [2024-06-27 22:21:27,284 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 213 predicate places. [2024-06-27 22:21:27,284 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 616 transitions, 9776 flow [2024-06-27 22:21:27,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:27,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:27,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:27,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:21:27,284 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:27,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1459591235, now seen corresponding path program 6 times [2024-06-27 22:21:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462194446] [2024-06-27 22:21:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:29,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462194446] [2024-06-27 22:21:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462194446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:29,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332225672] [2024-06-27 22:21:29,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:29,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:29,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 616 transitions, 9776 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:29,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:29,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:29,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:31,667 INFO L124 PetriNetUnfolderBase]: 6648/10996 cut-off events. [2024-06-27 22:21:31,669 INFO L125 PetriNetUnfolderBase]: For 409329/409329 co-relation queries the response was YES. [2024-06-27 22:21:31,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74214 conditions, 10996 events. 6648/10996 cut-off events. For 409329/409329 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 74225 event pairs, 1751 based on Foata normal form. 3/10708 useless extension candidates. Maximal degree in co-relation 74080. Up to 9160 conditions per place. [2024-06-27 22:21:31,827 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 538 selfloop transitions, 121 changer transitions 0/671 dead transitions. [2024-06-27 22:21:31,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 671 transitions, 11461 flow [2024-06-27 22:21:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-06-27 22:21:31,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488 [2024-06-27 22:21:31,829 INFO L175 Difference]: Start difference. First operand has 269 places, 616 transitions, 9776 flow. Second operand 10 states and 244 transitions. [2024-06-27 22:21:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 671 transitions, 11461 flow [2024-06-27 22:21:32,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 671 transitions, 11154 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:32,819 INFO L231 Difference]: Finished difference. Result has 273 places, 632 transitions, 9889 flow [2024-06-27 22:21:32,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9469, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9889, PETRI_PLACES=273, PETRI_TRANSITIONS=632} [2024-06-27 22:21:32,820 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 217 predicate places. [2024-06-27 22:21:32,820 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 632 transitions, 9889 flow [2024-06-27 22:21:32,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:32,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:32,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:21:32,821 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:32,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1575055385, now seen corresponding path program 7 times [2024-06-27 22:21:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800505012] [2024-06-27 22:21:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800505012] [2024-06-27 22:21:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800505012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:34,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800740864] [2024-06-27 22:21:34,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:34,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:34,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:34,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 632 transitions, 9889 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:34,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:34,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:34,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:37,651 INFO L124 PetriNetUnfolderBase]: 6802/11223 cut-off events. [2024-06-27 22:21:37,651 INFO L125 PetriNetUnfolderBase]: For 434071/434073 co-relation queries the response was YES. [2024-06-27 22:21:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76127 conditions, 11223 events. 6802/11223 cut-off events. For 434071/434073 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 75778 event pairs, 1837 based on Foata normal form. 3/10930 useless extension candidates. Maximal degree in co-relation 75992. Up to 8518 conditions per place. [2024-06-27 22:21:37,767 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 372 selfloop transitions, 346 changer transitions 0/730 dead transitions. [2024-06-27 22:21:37,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 730 transitions, 13022 flow [2024-06-27 22:21:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions. [2024-06-27 22:21:37,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-06-27 22:21:37,769 INFO L175 Difference]: Start difference. First operand has 273 places, 632 transitions, 9889 flow. Second operand 9 states and 246 transitions. [2024-06-27 22:21:37,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 730 transitions, 13022 flow [2024-06-27 22:21:38,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 730 transitions, 12778 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 22:21:38,627 INFO L231 Difference]: Finished difference. Result has 274 places, 668 transitions, 10946 flow [2024-06-27 22:21:38,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=9645, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10946, PETRI_PLACES=274, PETRI_TRANSITIONS=668} [2024-06-27 22:21:38,627 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 218 predicate places. [2024-06-27 22:21:38,627 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 668 transitions, 10946 flow [2024-06-27 22:21:38,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:38,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:38,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:38,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:21:38,628 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:38,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1575062143, now seen corresponding path program 2 times [2024-06-27 22:21:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148276949] [2024-06-27 22:21:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:40,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:40,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148276949] [2024-06-27 22:21:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148276949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:40,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875269258] [2024-06-27 22:21:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:40,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:40,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 668 transitions, 10946 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:43,433 INFO L124 PetriNetUnfolderBase]: 6910/11297 cut-off events. [2024-06-27 22:21:43,434 INFO L125 PetriNetUnfolderBase]: For 456063/456067 co-relation queries the response was YES. [2024-06-27 22:21:43,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78400 conditions, 11297 events. 6910/11297 cut-off events. For 456063/456067 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 75688 event pairs, 2303 based on Foata normal form. 5/11051 useless extension candidates. Maximal degree in co-relation 78263. Up to 9179 conditions per place. [2024-06-27 22:21:43,594 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 603 selfloop transitions, 145 changer transitions 0/760 dead transitions. [2024-06-27 22:21:43,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 760 transitions, 13649 flow [2024-06-27 22:21:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 22:21:43,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 22:21:43,595 INFO L175 Difference]: Start difference. First operand has 274 places, 668 transitions, 10946 flow. Second operand 9 states and 243 transitions. [2024-06-27 22:21:43,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 760 transitions, 13649 flow [2024-06-27 22:21:44,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 760 transitions, 13122 flow, removed 80 selfloop flow, removed 3 redundant places. [2024-06-27 22:21:44,673 INFO L231 Difference]: Finished difference. Result has 284 places, 705 transitions, 11410 flow [2024-06-27 22:21:44,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10419, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11410, PETRI_PLACES=284, PETRI_TRANSITIONS=705} [2024-06-27 22:21:44,688 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 228 predicate places. [2024-06-27 22:21:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 705 transitions, 11410 flow [2024-06-27 22:21:44,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:44,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:44,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:21:44,689 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:44,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1574882405, now seen corresponding path program 8 times [2024-06-27 22:21:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811299155] [2024-06-27 22:21:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811299155] [2024-06-27 22:21:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811299155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897607520] [2024-06-27 22:21:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:46,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:46,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 705 transitions, 11410 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:46,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:46,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:46,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:49,440 INFO L124 PetriNetUnfolderBase]: 6905/11433 cut-off events. [2024-06-27 22:21:49,441 INFO L125 PetriNetUnfolderBase]: For 471020/471022 co-relation queries the response was YES. [2024-06-27 22:21:49,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79102 conditions, 11433 events. 6905/11433 cut-off events. For 471020/471022 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 77848 event pairs, 1839 based on Foata normal form. 3/11126 useless extension candidates. Maximal degree in co-relation 78958. Up to 8664 conditions per place. [2024-06-27 22:21:49,598 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 409 selfloop transitions, 340 changer transitions 0/761 dead transitions. [2024-06-27 22:21:49,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 761 transitions, 13789 flow [2024-06-27 22:21:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:21:49,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-27 22:21:49,600 INFO L175 Difference]: Start difference. First operand has 284 places, 705 transitions, 11410 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:21:49,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 761 transitions, 13789 flow [2024-06-27 22:21:51,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 761 transitions, 13490 flow, removed 86 selfloop flow, removed 3 redundant places. [2024-06-27 22:21:51,034 INFO L231 Difference]: Finished difference. Result has 290 places, 705 transitions, 11812 flow [2024-06-27 22:21:51,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11111, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11812, PETRI_PLACES=290, PETRI_TRANSITIONS=705} [2024-06-27 22:21:51,035 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 234 predicate places. [2024-06-27 22:21:51,035 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 705 transitions, 11812 flow [2024-06-27 22:21:51,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:51,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:51,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:51,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:21:51,036 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:51,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1031530813, now seen corresponding path program 9 times [2024-06-27 22:21:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976217348] [2024-06-27 22:21:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976217348] [2024-06-27 22:21:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976217348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056160274] [2024-06-27 22:21:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:53,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:53,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:21:53,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 705 transitions, 11812 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:53,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:53,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:21:53,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:55,868 INFO L124 PetriNetUnfolderBase]: 6897/11422 cut-off events. [2024-06-27 22:21:55,869 INFO L125 PetriNetUnfolderBase]: For 486471/486473 co-relation queries the response was YES. [2024-06-27 22:21:55,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79700 conditions, 11422 events. 6897/11422 cut-off events. For 486471/486473 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 77824 event pairs, 1837 based on Foata normal form. 3/11116 useless extension candidates. Maximal degree in co-relation 79553. Up to 8656 conditions per place. [2024-06-27 22:21:56,045 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 392 selfloop transitions, 355 changer transitions 0/759 dead transitions. [2024-06-27 22:21:56,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 759 transitions, 14005 flow [2024-06-27 22:21:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-06-27 22:21:56,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355555555555556 [2024-06-27 22:21:56,047 INFO L175 Difference]: Start difference. First operand has 290 places, 705 transitions, 11812 flow. Second operand 9 states and 241 transitions. [2024-06-27 22:21:56,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 759 transitions, 14005 flow [2024-06-27 22:21:57,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 759 transitions, 13092 flow, removed 88 selfloop flow, removed 8 redundant places. [2024-06-27 22:21:57,840 INFO L231 Difference]: Finished difference. Result has 291 places, 705 transitions, 11633 flow [2024-06-27 22:21:57,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=10902, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11633, PETRI_PLACES=291, PETRI_TRANSITIONS=705} [2024-06-27 22:21:57,840 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 235 predicate places. [2024-06-27 22:21:57,841 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 705 transitions, 11633 flow [2024-06-27 22:21:57,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:57,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:57,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:57,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:21:57,841 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:57,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash 194968943, now seen corresponding path program 2 times [2024-06-27 22:21:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724381498] [2024-06-27 22:21:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724381498] [2024-06-27 22:21:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724381498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:21:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537872804] [2024-06-27 22:21:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:21:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:21:58,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:21:59,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:21:59,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 705 transitions, 11633 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:59,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:59,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:21:59,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:01,418 INFO L124 PetriNetUnfolderBase]: 6367/10708 cut-off events. [2024-06-27 22:22:01,419 INFO L125 PetriNetUnfolderBase]: For 533852/534301 co-relation queries the response was YES. [2024-06-27 22:22:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76289 conditions, 10708 events. 6367/10708 cut-off events. For 533852/534301 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 74469 event pairs, 2117 based on Foata normal form. 207/10466 useless extension candidates. Maximal degree in co-relation 76142. Up to 8621 conditions per place. [2024-06-27 22:22:01,551 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 598 selfloop transitions, 53 changer transitions 0/730 dead transitions. [2024-06-27 22:22:01,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 730 transitions, 13135 flow [2024-06-27 22:22:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:22:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:22:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 22:22:01,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2024-06-27 22:22:01,553 INFO L175 Difference]: Start difference. First operand has 291 places, 705 transitions, 11633 flow. Second operand 6 states and 161 transitions. [2024-06-27 22:22:01,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 730 transitions, 13135 flow [2024-06-27 22:22:02,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 730 transitions, 12545 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:02,717 INFO L231 Difference]: Finished difference. Result has 292 places, 713 transitions, 11276 flow [2024-06-27 22:22:02,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11043, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11276, PETRI_PLACES=292, PETRI_TRANSITIONS=713} [2024-06-27 22:22:02,718 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 236 predicate places. [2024-06-27 22:22:02,718 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 713 transitions, 11276 flow [2024-06-27 22:22:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:02,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:02,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:02,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:22:02,719 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:02,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 667099429, now seen corresponding path program 10 times [2024-06-27 22:22:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:02,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798958966] [2024-06-27 22:22:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798958966] [2024-06-27 22:22:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798958966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176988899] [2024-06-27 22:22:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:04,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:04,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:04,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 713 transitions, 11276 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:04,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:04,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:04,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:07,631 INFO L124 PetriNetUnfolderBase]: 6977/11532 cut-off events. [2024-06-27 22:22:07,632 INFO L125 PetriNetUnfolderBase]: For 514405/514405 co-relation queries the response was YES. [2024-06-27 22:22:07,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80477 conditions, 11532 events. 6977/11532 cut-off events. For 514405/514405 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 78510 event pairs, 1726 based on Foata normal form. 3/11230 useless extension candidates. Maximal degree in co-relation 80328. Up to 8754 conditions per place. [2024-06-27 22:22:07,814 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 361 selfloop transitions, 392 changer transitions 0/765 dead transitions. [2024-06-27 22:22:07,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 765 transitions, 13498 flow [2024-06-27 22:22:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-06-27 22:22:07,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244444444444445 [2024-06-27 22:22:07,816 INFO L175 Difference]: Start difference. First operand has 292 places, 713 transitions, 11276 flow. Second operand 9 states and 236 transitions. [2024-06-27 22:22:07,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 765 transitions, 13498 flow [2024-06-27 22:22:09,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 765 transitions, 13383 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 22:22:09,519 INFO L231 Difference]: Finished difference. Result has 298 places, 721 transitions, 12137 flow [2024-06-27 22:22:09,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11161, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12137, PETRI_PLACES=298, PETRI_TRANSITIONS=721} [2024-06-27 22:22:09,520 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 242 predicate places. [2024-06-27 22:22:09,520 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 721 transitions, 12137 flow [2024-06-27 22:22:09,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:09,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:09,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:09,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:22:09,521 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:09,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -49008979, now seen corresponding path program 3 times [2024-06-27 22:22:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:09,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383973203] [2024-06-27 22:22:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383973203] [2024-06-27 22:22:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383973203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011059537] [2024-06-27 22:22:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:11,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:11,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 721 transitions, 12137 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:11,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:11,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:11,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:14,475 INFO L124 PetriNetUnfolderBase]: 7154/11883 cut-off events. [2024-06-27 22:22:14,475 INFO L125 PetriNetUnfolderBase]: For 546897/546901 co-relation queries the response was YES. [2024-06-27 22:22:14,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84171 conditions, 11883 events. 7154/11883 cut-off events. For 546897/546901 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 81708 event pairs, 2474 based on Foata normal form. 7/11578 useless extension candidates. Maximal degree in co-relation 84020. Up to 9490 conditions per place. [2024-06-27 22:22:14,642 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 624 selfloop transitions, 168 changer transitions 0/804 dead transitions. [2024-06-27 22:22:14,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 804 transitions, 15065 flow [2024-06-27 22:22:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-06-27 22:22:14,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377777777777778 [2024-06-27 22:22:14,644 INFO L175 Difference]: Start difference. First operand has 298 places, 721 transitions, 12137 flow. Second operand 9 states and 242 transitions. [2024-06-27 22:22:14,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 804 transitions, 15065 flow [2024-06-27 22:22:16,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 804 transitions, 14448 flow, removed 58 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:16,497 INFO L231 Difference]: Finished difference. Result has 302 places, 743 transitions, 12319 flow [2024-06-27 22:22:16,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=11520, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12319, PETRI_PLACES=302, PETRI_TRANSITIONS=743} [2024-06-27 22:22:16,498 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 246 predicate places. [2024-06-27 22:22:16,498 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 743 transitions, 12319 flow [2024-06-27 22:22:16,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:16,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:16,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:16,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:22:16,498 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:16,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash -40438099, now seen corresponding path program 4 times [2024-06-27 22:22:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740363176] [2024-06-27 22:22:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740363176] [2024-06-27 22:22:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740363176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:18,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495462407] [2024-06-27 22:22:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:18,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:18,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:18,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:18,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:18,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 743 transitions, 12319 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:18,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:18,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:18,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:21,487 INFO L124 PetriNetUnfolderBase]: 7172/11818 cut-off events. [2024-06-27 22:22:21,487 INFO L125 PetriNetUnfolderBase]: For 569465/569469 co-relation queries the response was YES. [2024-06-27 22:22:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85024 conditions, 11818 events. 7172/11818 cut-off events. For 569465/569469 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 80445 event pairs, 2291 based on Foata normal form. 8/11532 useless extension candidates. Maximal degree in co-relation 84869. Up to 9379 conditions per place. [2024-06-27 22:22:21,637 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 597 selfloop transitions, 224 changer transitions 0/833 dead transitions. [2024-06-27 22:22:21,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 833 transitions, 15399 flow [2024-06-27 22:22:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:22:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:22:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 285 transitions. [2024-06-27 22:22:21,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2024-06-27 22:22:21,638 INFO L175 Difference]: Start difference. First operand has 302 places, 743 transitions, 12319 flow. Second operand 11 states and 285 transitions. [2024-06-27 22:22:21,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 833 transitions, 15399 flow [2024-06-27 22:22:23,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 833 transitions, 15109 flow, removed 65 selfloop flow, removed 2 redundant places. [2024-06-27 22:22:23,507 INFO L231 Difference]: Finished difference. Result has 315 places, 775 transitions, 13381 flow [2024-06-27 22:22:23,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=12071, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13381, PETRI_PLACES=315, PETRI_TRANSITIONS=775} [2024-06-27 22:22:23,508 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 259 predicate places. [2024-06-27 22:22:23,508 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 775 transitions, 13381 flow [2024-06-27 22:22:23,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:23,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:23,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:23,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:22:23,508 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:23,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash 235936383, now seen corresponding path program 5 times [2024-06-27 22:22:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193371050] [2024-06-27 22:22:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:25,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193371050] [2024-06-27 22:22:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193371050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539965957] [2024-06-27 22:22:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:25,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:25,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:25,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 775 transitions, 13381 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:25,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:25,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:25,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:28,596 INFO L124 PetriNetUnfolderBase]: 7162/11814 cut-off events. [2024-06-27 22:22:28,596 INFO L125 PetriNetUnfolderBase]: For 614354/614358 co-relation queries the response was YES. [2024-06-27 22:22:28,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87820 conditions, 11814 events. 7162/11814 cut-off events. For 614354/614358 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 80450 event pairs, 2292 based on Foata normal form. 7/11524 useless extension candidates. Maximal degree in co-relation 87658. Up to 9470 conditions per place. [2024-06-27 22:22:28,775 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 617 selfloop transitions, 200 changer transitions 0/829 dead transitions. [2024-06-27 22:22:28,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 829 transitions, 15690 flow [2024-06-27 22:22:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:22:28,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311111111111111 [2024-06-27 22:22:28,776 INFO L175 Difference]: Start difference. First operand has 315 places, 775 transitions, 13381 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:22:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 829 transitions, 15690 flow [2024-06-27 22:22:30,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 829 transitions, 15300 flow, removed 158 selfloop flow, removed 3 redundant places. [2024-06-27 22:22:30,583 INFO L231 Difference]: Finished difference. Result has 322 places, 776 transitions, 13449 flow [2024-06-27 22:22:30,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=12993, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13449, PETRI_PLACES=322, PETRI_TRANSITIONS=776} [2024-06-27 22:22:30,584 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 266 predicate places. [2024-06-27 22:22:30,584 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 776 transitions, 13449 flow [2024-06-27 22:22:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:30,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:30,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:30,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:22:30,584 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:30,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash -49015737, now seen corresponding path program 11 times [2024-06-27 22:22:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459167169] [2024-06-27 22:22:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:32,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459167169] [2024-06-27 22:22:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459167169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93457909] [2024-06-27 22:22:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:32,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:32,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:32,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 776 transitions, 13449 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:32,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:32,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:32,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:35,915 INFO L124 PetriNetUnfolderBase]: 7236/11944 cut-off events. [2024-06-27 22:22:35,915 INFO L125 PetriNetUnfolderBase]: For 622457/622457 co-relation queries the response was YES. [2024-06-27 22:22:36,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87814 conditions, 11944 events. 7236/11944 cut-off events. For 622457/622457 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 81552 event pairs, 1724 based on Foata normal form. 3/11633 useless extension candidates. Maximal degree in co-relation 87647. Up to 9089 conditions per place. [2024-06-27 22:22:36,081 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 449 selfloop transitions, 382 changer transitions 0/843 dead transitions. [2024-06-27 22:22:36,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 843 transitions, 16263 flow [2024-06-27 22:22:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:22:36,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311111111111111 [2024-06-27 22:22:36,083 INFO L175 Difference]: Start difference. First operand has 322 places, 776 transitions, 13449 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:22:36,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 843 transitions, 16263 flow [2024-06-27 22:22:37,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 843 transitions, 15964 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:37,943 INFO L231 Difference]: Finished difference. Result has 326 places, 792 transitions, 14218 flow [2024-06-27 22:22:37,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13150, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14218, PETRI_PLACES=326, PETRI_TRANSITIONS=792} [2024-06-27 22:22:37,943 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 270 predicate places. [2024-06-27 22:22:37,943 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 792 transitions, 14218 flow [2024-06-27 22:22:37,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:37,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:37,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:37,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:22:37,944 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:37,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 227661925, now seen corresponding path program 12 times [2024-06-27 22:22:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194231626] [2024-06-27 22:22:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:39,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194231626] [2024-06-27 22:22:39,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194231626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:39,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036810277] [2024-06-27 22:22:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:39,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:39,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:39,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 792 transitions, 14218 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:39,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:39,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:39,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:43,208 INFO L124 PetriNetUnfolderBase]: 7228/11933 cut-off events. [2024-06-27 22:22:43,208 INFO L125 PetriNetUnfolderBase]: For 638945/638945 co-relation queries the response was YES. [2024-06-27 22:22:43,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88563 conditions, 11933 events. 7228/11933 cut-off events. For 638945/638945 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 81510 event pairs, 1724 based on Foata normal form. 3/11622 useless extension candidates. Maximal degree in co-relation 88393. Up to 9081 conditions per place. [2024-06-27 22:22:43,385 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 453 selfloop transitions, 380 changer transitions 0/845 dead transitions. [2024-06-27 22:22:43,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 845 transitions, 16604 flow [2024-06-27 22:22:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-27 22:22:43,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2024-06-27 22:22:43,387 INFO L175 Difference]: Start difference. First operand has 326 places, 792 transitions, 14218 flow. Second operand 9 states and 238 transitions. [2024-06-27 22:22:43,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 845 transitions, 16604 flow [2024-06-27 22:22:46,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 845 transitions, 15913 flow, removed 90 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:46,120 INFO L231 Difference]: Finished difference. Result has 330 places, 792 transitions, 14303 flow [2024-06-27 22:22:46,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13527, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=380, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14303, PETRI_PLACES=330, PETRI_TRANSITIONS=792} [2024-06-27 22:22:46,121 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 274 predicate places. [2024-06-27 22:22:46,121 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 792 transitions, 14303 flow [2024-06-27 22:22:46,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:46,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:46,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:46,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:22:46,121 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:46,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash -866071169, now seen corresponding path program 13 times [2024-06-27 22:22:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:46,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942242874] [2024-06-27 22:22:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:46,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942242874] [2024-06-27 22:22:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942242874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817633948] [2024-06-27 22:22:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:47,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:47,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:47,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 792 transitions, 14303 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:47,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:47,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:47,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:51,007 INFO L124 PetriNetUnfolderBase]: 7260/11985 cut-off events. [2024-06-27 22:22:51,007 INFO L125 PetriNetUnfolderBase]: For 659502/659502 co-relation queries the response was YES. [2024-06-27 22:22:51,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89102 conditions, 11985 events. 7260/11985 cut-off events. For 659502/659502 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 81861 event pairs, 1737 based on Foata normal form. 3/11673 useless extension candidates. Maximal degree in co-relation 88929. Up to 9115 conditions per place. [2024-06-27 22:22:51,197 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 461 selfloop transitions, 377 changer transitions 0/850 dead transitions. [2024-06-27 22:22:51,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 850 transitions, 16837 flow [2024-06-27 22:22:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-27 22:22:51,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2024-06-27 22:22:51,199 INFO L175 Difference]: Start difference. First operand has 330 places, 792 transitions, 14303 flow. Second operand 9 states and 238 transitions. [2024-06-27 22:22:51,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 850 transitions, 16837 flow [2024-06-27 22:22:53,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 850 transitions, 16301 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:22:53,030 INFO L231 Difference]: Finished difference. Result has 335 places, 800 transitions, 14705 flow [2024-06-27 22:22:53,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13775, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14705, PETRI_PLACES=335, PETRI_TRANSITIONS=800} [2024-06-27 22:22:53,031 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 279 predicate places. [2024-06-27 22:22:53,031 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 800 transitions, 14705 flow [2024-06-27 22:22:53,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:53,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:53,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:53,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:22:53,031 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:53,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -245735, now seen corresponding path program 14 times [2024-06-27 22:22:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759927972] [2024-06-27 22:22:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:54,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759927972] [2024-06-27 22:22:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759927972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865983876] [2024-06-27 22:22:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:54,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:54,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:22:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 800 transitions, 14705 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:22:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:54,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:22:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:58,179 INFO L124 PetriNetUnfolderBase]: 7292/12037 cut-off events. [2024-06-27 22:22:58,179 INFO L125 PetriNetUnfolderBase]: For 676000/676000 co-relation queries the response was YES. [2024-06-27 22:22:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89143 conditions, 12037 events. 7292/12037 cut-off events. For 676000/676000 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 82364 event pairs, 1735 based on Foata normal form. 3/11726 useless extension candidates. Maximal degree in co-relation 88967. Up to 9149 conditions per place. [2024-06-27 22:22:58,351 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 477 selfloop transitions, 379 changer transitions 0/868 dead transitions. [2024-06-27 22:22:58,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 868 transitions, 17463 flow [2024-06-27 22:22:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-06-27 22:22:58,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 22:22:58,354 INFO L175 Difference]: Start difference. First operand has 335 places, 800 transitions, 14705 flow. Second operand 9 states and 240 transitions. [2024-06-27 22:22:58,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 868 transitions, 17463 flow [2024-06-27 22:23:00,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 868 transitions, 16646 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-27 22:23:00,747 INFO L231 Difference]: Finished difference. Result has 337 places, 808 transitions, 14838 flow [2024-06-27 22:23:00,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13908, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14838, PETRI_PLACES=337, PETRI_TRANSITIONS=808} [2024-06-27 22:23:00,748 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 281 predicate places. [2024-06-27 22:23:00,748 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 808 transitions, 14838 flow [2024-06-27 22:23:00,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:00,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:00,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:00,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:23:00,748 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:00,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash -276910129, now seen corresponding path program 6 times [2024-06-27 22:23:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134325690] [2024-06-27 22:23:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134325690] [2024-06-27 22:23:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134325690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:02,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:02,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:02,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118663264] [2024-06-27 22:23:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:02,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:23:02,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 808 transitions, 14838 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:02,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:02,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:23:02,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:05,988 INFO L124 PetriNetUnfolderBase]: 7282/11992 cut-off events. [2024-06-27 22:23:05,988 INFO L125 PetriNetUnfolderBase]: For 690589/690593 co-relation queries the response was YES. [2024-06-27 22:23:06,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89012 conditions, 11992 events. 7282/11992 cut-off events. For 690589/690593 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 81789 event pairs, 2294 based on Foata normal form. 7/11705 useless extension candidates. Maximal degree in co-relation 88834. Up to 9638 conditions per place. [2024-06-27 22:23:06,208 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 670 selfloop transitions, 183 changer transitions 0/865 dead transitions. [2024-06-27 22:23:06,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 865 transitions, 17116 flow [2024-06-27 22:23:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:23:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:23:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 22:23:06,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311111111111111 [2024-06-27 22:23:06,209 INFO L175 Difference]: Start difference. First operand has 337 places, 808 transitions, 14838 flow. Second operand 9 states and 239 transitions. [2024-06-27 22:23:06,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 865 transitions, 17116 flow [2024-06-27 22:23:08,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 865 transitions, 16185 flow, removed 54 selfloop flow, removed 6 redundant places. [2024-06-27 22:23:08,604 INFO L231 Difference]: Finished difference. Result has 340 places, 808 transitions, 14288 flow [2024-06-27 22:23:08,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13907, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14288, PETRI_PLACES=340, PETRI_TRANSITIONS=808} [2024-06-27 22:23:08,605 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 284 predicate places. [2024-06-27 22:23:08,605 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 808 transitions, 14288 flow [2024-06-27 22:23:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:08,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:08,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:08,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:23:08,605 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:08,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -276910377, now seen corresponding path program 15 times [2024-06-27 22:23:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481868813] [2024-06-27 22:23:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481868813] [2024-06-27 22:23:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481868813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519431140] [2024-06-27 22:23:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:10,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:10,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:10,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:10,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:23:10,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 808 transitions, 14288 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:10,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:10,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:23:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:13,734 INFO L124 PetriNetUnfolderBase]: 7276/12015 cut-off events. [2024-06-27 22:23:13,735 INFO L125 PetriNetUnfolderBase]: For 689796/689796 co-relation queries the response was YES. [2024-06-27 22:23:13,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88306 conditions, 12015 events. 7276/12015 cut-off events. For 689796/689796 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 82138 event pairs, 1735 based on Foata normal form. 3/11704 useless extension candidates. Maximal degree in co-relation 88125. Up to 9130 conditions per place. [2024-06-27 22:23:13,909 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 469 selfloop transitions, 381 changer transitions 0/862 dead transitions. [2024-06-27 22:23:13,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 862 transitions, 16566 flow [2024-06-27 22:23:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:23:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:23:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 22:23:13,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-06-27 22:23:13,911 INFO L175 Difference]: Start difference. First operand has 340 places, 808 transitions, 14288 flow. Second operand 9 states and 237 transitions. [2024-06-27 22:23:13,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 862 transitions, 16566 flow [2024-06-27 22:23:15,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 862 transitions, 16198 flow, removed 67 selfloop flow, removed 7 redundant places. [2024-06-27 22:23:15,818 INFO L231 Difference]: Finished difference. Result has 342 places, 808 transitions, 14698 flow [2024-06-27 22:23:15,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13920, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14698, PETRI_PLACES=342, PETRI_TRANSITIONS=808} [2024-06-27 22:23:15,819 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 286 predicate places. [2024-06-27 22:23:15,819 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 808 transitions, 14698 flow [2024-06-27 22:23:15,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:15,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:15,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:15,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:23:15,819 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:15,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1514135753, now seen corresponding path program 3 times [2024-06-27 22:23:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:15,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288445680] [2024-06-27 22:23:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:15,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:17,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:17,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288445680] [2024-06-27 22:23:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288445680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:17,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476679387] [2024-06-27 22:23:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:17,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:17,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:17,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:17,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:23:17,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 808 transitions, 14698 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:17,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:17,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:23:17,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:19,525 INFO L124 PetriNetUnfolderBase]: 6725/11229 cut-off events. [2024-06-27 22:23:19,526 INFO L125 PetriNetUnfolderBase]: For 796097/796664 co-relation queries the response was YES. [2024-06-27 22:23:19,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87207 conditions, 11229 events. 6725/11229 cut-off events. For 796097/796664 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 78240 event pairs, 2059 based on Foata normal form. 210/10977 useless extension candidates. Maximal degree in co-relation 87027. Up to 9060 conditions per place. [2024-06-27 22:23:19,704 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 682 selfloop transitions, 63 changer transitions 0/826 dead transitions. [2024-06-27 22:23:19,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 826 transitions, 16370 flow [2024-06-27 22:23:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-06-27 22:23:19,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2024-06-27 22:23:19,706 INFO L175 Difference]: Start difference. First operand has 342 places, 808 transitions, 14698 flow. Second operand 6 states and 158 transitions. [2024-06-27 22:23:19,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 826 transitions, 16370 flow [2024-06-27 22:23:22,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 826 transitions, 14809 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:23:22,131 INFO L231 Difference]: Finished difference. Result has 338 places, 812 transitions, 13364 flow [2024-06-27 22:23:22,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13137, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13364, PETRI_PLACES=338, PETRI_TRANSITIONS=812} [2024-06-27 22:23:22,132 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 282 predicate places. [2024-06-27 22:23:22,132 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 812 transitions, 13364 flow [2024-06-27 22:23:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:22,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:22,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:22,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:23:22,133 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:22,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 667407259, now seen corresponding path program 1 times [2024-06-27 22:23:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760562406] [2024-06-27 22:23:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760562406] [2024-06-27 22:23:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760562406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616318373] [2024-06-27 22:23:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:24,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:24,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:24,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:24,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:23:24,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 812 transitions, 13364 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:24,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:24,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:23:24,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:27,205 INFO L124 PetriNetUnfolderBase]: 6655/11205 cut-off events. [2024-06-27 22:23:27,205 INFO L125 PetriNetUnfolderBase]: For 626265/626265 co-relation queries the response was YES. [2024-06-27 22:23:27,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81610 conditions, 11205 events. 6655/11205 cut-off events. For 626265/626265 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 77819 event pairs, 2260 based on Foata normal form. 4/10931 useless extension candidates. Maximal degree in co-relation 81428. Up to 9274 conditions per place. [2024-06-27 22:23:27,361 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 814 selfloop transitions, 34 changer transitions 0/861 dead transitions. [2024-06-27 22:23:27,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 861 transitions, 15478 flow [2024-06-27 22:23:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:23:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:23:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-06-27 22:23:27,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506 [2024-06-27 22:23:27,363 INFO L175 Difference]: Start difference. First operand has 338 places, 812 transitions, 13364 flow. Second operand 10 states and 253 transitions. [2024-06-27 22:23:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 861 transitions, 15478 flow [2024-06-27 22:23:29,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 861 transitions, 15283 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:29,156 INFO L231 Difference]: Finished difference. Result has 344 places, 815 transitions, 13335 flow [2024-06-27 22:23:29,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13169, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13335, PETRI_PLACES=344, PETRI_TRANSITIONS=815} [2024-06-27 22:23:29,158 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 288 predicate places. [2024-06-27 22:23:29,159 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 815 transitions, 13335 flow [2024-06-27 22:23:29,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:29,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:29,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:29,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:23:29,159 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:29,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1452128167, now seen corresponding path program 1 times [2024-06-27 22:23:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610291533] [2024-06-27 22:23:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610291533] [2024-06-27 22:23:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610291533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:30,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:23:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095597691] [2024-06-27 22:23:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:30,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:23:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:23:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:23:30,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 22:23:30,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 815 transitions, 13335 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:30,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:30,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 22:23:30,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:32,910 INFO L124 PetriNetUnfolderBase]: 6409/10705 cut-off events. [2024-06-27 22:23:32,911 INFO L125 PetriNetUnfolderBase]: For 705412/705872 co-relation queries the response was YES. [2024-06-27 22:23:33,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80332 conditions, 10705 events. 6409/10705 cut-off events. For 705412/705872 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 73871 event pairs, 2256 based on Foata normal form. 222/10496 useless extension candidates. Maximal degree in co-relation 80149. Up to 8803 conditions per place. [2024-06-27 22:23:33,074 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 733 selfloop transitions, 23 changer transitions 0/836 dead transitions. [2024-06-27 22:23:33,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 836 transitions, 15047 flow [2024-06-27 22:23:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:23:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:23:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 22:23:33,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2024-06-27 22:23:33,075 INFO L175 Difference]: Start difference. First operand has 344 places, 815 transitions, 13335 flow. Second operand 7 states and 178 transitions. [2024-06-27 22:23:33,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 836 transitions, 15047 flow [2024-06-27 22:23:34,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 836 transitions, 14882 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-27 22:23:34,753 INFO L231 Difference]: Finished difference. Result has 342 places, 819 transitions, 13313 flow [2024-06-27 22:23:34,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13170, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13313, PETRI_PLACES=342, PETRI_TRANSITIONS=819} [2024-06-27 22:23:34,754 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 286 predicate places. [2024-06-27 22:23:34,754 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 819 transitions, 13313 flow [2024-06-27 22:23:34,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:34,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:34,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:34,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:23:34,755 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:34,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -298413305, now seen corresponding path program 1 times [2024-06-27 22:23:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732767546] [2024-06-27 22:23:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732767546] [2024-06-27 22:23:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732767546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735945757] [2024-06-27 22:23:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:36,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:36,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:36,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:23:36,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 819 transitions, 13313 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:36,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:36,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:23:36,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:39,356 INFO L124 PetriNetUnfolderBase]: 7338/12024 cut-off events. [2024-06-27 22:23:39,356 INFO L125 PetriNetUnfolderBase]: For 755264/755266 co-relation queries the response was YES. [2024-06-27 22:23:39,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90712 conditions, 12024 events. 7338/12024 cut-off events. For 755264/755266 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 81381 event pairs, 2081 based on Foata normal form. 6/11727 useless extension candidates. Maximal degree in co-relation 90530. Up to 9588 conditions per place. [2024-06-27 22:23:39,540 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 694 selfloop transitions, 193 changer transitions 0/899 dead transitions. [2024-06-27 22:23:39,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 899 transitions, 15943 flow [2024-06-27 22:23:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:23:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:23:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 359 transitions. [2024-06-27 22:23:39,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128571428571429 [2024-06-27 22:23:39,547 INFO L175 Difference]: Start difference. First operand has 342 places, 819 transitions, 13313 flow. Second operand 14 states and 359 transitions. [2024-06-27 22:23:39,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 899 transitions, 15943 flow [2024-06-27 22:23:41,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 899 transitions, 15835 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-27 22:23:41,985 INFO L231 Difference]: Finished difference. Result has 352 places, 825 transitions, 13784 flow [2024-06-27 22:23:41,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13205, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13784, PETRI_PLACES=352, PETRI_TRANSITIONS=825} [2024-06-27 22:23:41,986 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 296 predicate places. [2024-06-27 22:23:41,986 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 825 transitions, 13784 flow [2024-06-27 22:23:41,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:41,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:41,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:23:41,986 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:41,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1350137997, now seen corresponding path program 2 times [2024-06-27 22:23:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197230507] [2024-06-27 22:23:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197230507] [2024-06-27 22:23:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197230507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:43,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629082284] [2024-06-27 22:23:43,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:43,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:43,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:43,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:43,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:43,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:23:43,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 825 transitions, 13784 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:43,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:43,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:23:43,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:47,026 INFO L124 PetriNetUnfolderBase]: 7357/12095 cut-off events. [2024-06-27 22:23:47,026 INFO L125 PetriNetUnfolderBase]: For 779882/779884 co-relation queries the response was YES. [2024-06-27 22:23:47,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92454 conditions, 12095 events. 7357/12095 cut-off events. For 779882/779884 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 82205 event pairs, 2217 based on Foata normal form. 6/11804 useless extension candidates. Maximal degree in co-relation 92270. Up to 10027 conditions per place. [2024-06-27 22:23:47,203 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 731 selfloop transitions, 158 changer transitions 0/901 dead transitions. [2024-06-27 22:23:47,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 901 transitions, 16108 flow [2024-06-27 22:23:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:23:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:23:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 375 transitions. [2024-06-27 22:23:47,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:23:47,205 INFO L175 Difference]: Start difference. First operand has 352 places, 825 transitions, 13784 flow. Second operand 15 states and 375 transitions. [2024-06-27 22:23:47,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 901 transitions, 16108 flow [2024-06-27 22:23:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 901 transitions, 15778 flow, removed 77 selfloop flow, removed 9 redundant places. [2024-06-27 22:23:49,459 INFO L231 Difference]: Finished difference. Result has 358 places, 828 transitions, 13881 flow [2024-06-27 22:23:49,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13490, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13881, PETRI_PLACES=358, PETRI_TRANSITIONS=828} [2024-06-27 22:23:49,460 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 302 predicate places. [2024-06-27 22:23:49,460 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 828 transitions, 13881 flow [2024-06-27 22:23:49,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:49,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:49,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:49,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:23:49,461 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:49,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash -184948655, now seen corresponding path program 3 times [2024-06-27 22:23:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522371291] [2024-06-27 22:23:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522371291] [2024-06-27 22:23:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522371291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:23:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385663527] [2024-06-27 22:23:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:50,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:23:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:23:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:23:51,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:23:51,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 828 transitions, 13881 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:51,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:51,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:23:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:54,595 INFO L124 PetriNetUnfolderBase]: 7377/12115 cut-off events. [2024-06-27 22:23:54,595 INFO L125 PetriNetUnfolderBase]: For 793837/793839 co-relation queries the response was YES. [2024-06-27 22:23:54,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92785 conditions, 12115 events. 7377/12115 cut-off events. For 793837/793839 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 82219 event pairs, 2187 based on Foata normal form. 6/11824 useless extension candidates. Maximal degree in co-relation 92599. Up to 9930 conditions per place. [2024-06-27 22:23:54,794 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 720 selfloop transitions, 167 changer transitions 0/899 dead transitions. [2024-06-27 22:23:54,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 899 transitions, 16127 flow [2024-06-27 22:23:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:23:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:23:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 354 transitions. [2024-06-27 22:23:54,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2024-06-27 22:23:54,796 INFO L175 Difference]: Start difference. First operand has 358 places, 828 transitions, 13881 flow. Second operand 14 states and 354 transitions. [2024-06-27 22:23:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 899 transitions, 16127 flow [2024-06-27 22:23:57,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 899 transitions, 15762 flow, removed 23 selfloop flow, removed 13 redundant places. [2024-06-27 22:23:57,617 INFO L231 Difference]: Finished difference. Result has 359 places, 831 transitions, 13931 flow [2024-06-27 22:23:57,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13516, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13931, PETRI_PLACES=359, PETRI_TRANSITIONS=831} [2024-06-27 22:23:57,617 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 303 predicate places. [2024-06-27 22:23:57,618 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 831 transitions, 13931 flow [2024-06-27 22:23:57,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:57,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:57,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:57,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:23:57,618 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:57,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -785759855, now seen corresponding path program 4 times [2024-06-27 22:23:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60419653] [2024-06-27 22:23:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60419653] [2024-06-27 22:23:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60419653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8362140] [2024-06-27 22:23:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:59,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2024-06-27 22:23:59,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 831 transitions, 13931 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:23:59,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:59,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2024-06-27 22:23:59,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:02,226 INFO L124 PetriNetUnfolderBase]: 6263/10784 cut-off events. [2024-06-27 22:24:02,226 INFO L125 PetriNetUnfolderBase]: For 689751/690086 co-relation queries the response was YES. [2024-06-27 22:24:02,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82307 conditions, 10784 events. 6263/10784 cut-off events. For 689751/690086 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 76915 event pairs, 1223 based on Foata normal form. 143/10595 useless extension candidates. Maximal degree in co-relation 82120. Up to 7162 conditions per place. [2024-06-27 22:24:02,384 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 546 selfloop transitions, 254 changer transitions 0/915 dead transitions. [2024-06-27 22:24:02,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 915 transitions, 16655 flow [2024-06-27 22:24:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:24:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:24:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 390 transitions. [2024-06-27 22:24:02,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-27 22:24:02,386 INFO L175 Difference]: Start difference. First operand has 359 places, 831 transitions, 13931 flow. Second operand 14 states and 390 transitions. [2024-06-27 22:24:02,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 915 transitions, 16655 flow [2024-06-27 22:24:04,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 915 transitions, 16276 flow, removed 26 selfloop flow, removed 12 redundant places. [2024-06-27 22:24:04,852 INFO L231 Difference]: Finished difference. Result has 362 places, 842 transitions, 14480 flow [2024-06-27 22:24:04,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=13552, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14480, PETRI_PLACES=362, PETRI_TRANSITIONS=842} [2024-06-27 22:24:04,853 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 306 predicate places. [2024-06-27 22:24:04,853 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 842 transitions, 14480 flow [2024-06-27 22:24:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:04,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:04,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:24:04,853 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:04,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -180182033, now seen corresponding path program 1 times [2024-06-27 22:24:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193942701] [2024-06-27 22:24:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:06,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193942701] [2024-06-27 22:24:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193942701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:24:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252974478] [2024-06-27 22:24:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:06,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:24:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:24:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:24:06,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:24:06,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 842 transitions, 14480 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:06,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:06,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:24:06,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:10,684 INFO L124 PetriNetUnfolderBase]: 7598/12556 cut-off events. [2024-06-27 22:24:10,684 INFO L125 PetriNetUnfolderBase]: For 874004/874006 co-relation queries the response was YES. [2024-06-27 22:24:10,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98558 conditions, 12556 events. 7598/12556 cut-off events. For 874004/874006 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 86302 event pairs, 2171 based on Foata normal form. 4/12237 useless extension candidates. Maximal degree in co-relation 98369. Up to 10078 conditions per place. [2024-06-27 22:24:10,903 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 760 selfloop transitions, 214 changer transitions 0/986 dead transitions. [2024-06-27 22:24:10,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 986 transitions, 18157 flow [2024-06-27 22:24:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 22:24:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 22:24:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 469 transitions. [2024-06-27 22:24:10,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211111111111111 [2024-06-27 22:24:10,905 INFO L175 Difference]: Start difference. First operand has 362 places, 842 transitions, 14480 flow. Second operand 18 states and 469 transitions. [2024-06-27 22:24:10,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 986 transitions, 18157 flow [2024-06-27 22:24:14,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 986 transitions, 17769 flow, removed 89 selfloop flow, removed 11 redundant places. [2024-06-27 22:24:14,078 INFO L231 Difference]: Finished difference. Result has 373 places, 869 transitions, 15092 flow [2024-06-27 22:24:14,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=14128, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15092, PETRI_PLACES=373, PETRI_TRANSITIONS=869} [2024-06-27 22:24:14,079 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 317 predicate places. [2024-06-27 22:24:14,079 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 869 transitions, 15092 flow [2024-06-27 22:24:14,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:14,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:14,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:14,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:24:14,079 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:14,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1733208161, now seen corresponding path program 1 times [2024-06-27 22:24:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989148988] [2024-06-27 22:24:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989148988] [2024-06-27 22:24:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989148988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:24:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515126208] [2024-06-27 22:24:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:24:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:24:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:24:15,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 22:24:15,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 869 transitions, 15092 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:15,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:15,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 22:24:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:18,551 INFO L124 PetriNetUnfolderBase]: 7369/12289 cut-off events. [2024-06-27 22:24:18,551 INFO L125 PetriNetUnfolderBase]: For 855933/855941 co-relation queries the response was YES. [2024-06-27 22:24:18,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98527 conditions, 12289 events. 7369/12289 cut-off events. For 855933/855941 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 85630 event pairs, 1957 based on Foata normal form. 6/11983 useless extension candidates. Maximal degree in co-relation 98334. Up to 9729 conditions per place. [2024-06-27 22:24:18,763 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 699 selfloop transitions, 196 changer transitions 0/955 dead transitions. [2024-06-27 22:24:18,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 955 transitions, 18149 flow [2024-06-27 22:24:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:24:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:24:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-06-27 22:24:18,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422222222222223 [2024-06-27 22:24:18,765 INFO L175 Difference]: Start difference. First operand has 373 places, 869 transitions, 15092 flow. Second operand 9 states and 244 transitions. [2024-06-27 22:24:18,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 955 transitions, 18149 flow [2024-06-27 22:24:21,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 955 transitions, 17943 flow, removed 70 selfloop flow, removed 5 redundant places. [2024-06-27 22:24:21,385 INFO L231 Difference]: Finished difference. Result has 379 places, 916 transitions, 16473 flow [2024-06-27 22:24:21,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=14894, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16473, PETRI_PLACES=379, PETRI_TRANSITIONS=916} [2024-06-27 22:24:21,388 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 323 predicate places. [2024-06-27 22:24:21,388 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 916 transitions, 16473 flow [2024-06-27 22:24:21,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:21,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:21,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:24:21,389 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:21,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1085109493, now seen corresponding path program 5 times [2024-06-27 22:24:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179978066] [2024-06-27 22:24:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:23,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-27 22:24:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179978066] [2024-06-27 22:24:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179978066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599330977] [2024-06-27 22:24:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:23,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:24:23,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 916 transitions, 16473 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:23,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:23,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:24:23,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:27,367 INFO L124 PetriNetUnfolderBase]: 7941/13002 cut-off events. [2024-06-27 22:24:27,368 INFO L125 PetriNetUnfolderBase]: For 933146/933148 co-relation queries the response was YES. [2024-06-27 22:24:27,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107407 conditions, 13002 events. 7941/13002 cut-off events. For 933146/933148 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 88903 event pairs, 1803 based on Foata normal form. 8/12698 useless extension candidates. Maximal degree in co-relation 107210. Up to 10381 conditions per place. [2024-06-27 22:24:27,863 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 812 selfloop transitions, 183 changer transitions 0/1007 dead transitions. [2024-06-27 22:24:27,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1007 transitions, 19734 flow [2024-06-27 22:24:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:24:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:24:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions. [2024-06-27 22:24:27,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163636363636364 [2024-06-27 22:24:27,865 INFO L175 Difference]: Start difference. First operand has 379 places, 916 transitions, 16473 flow. Second operand 11 states and 284 transitions. [2024-06-27 22:24:27,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 1007 transitions, 19734 flow [2024-06-27 22:24:30,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1007 transitions, 19452 flow, removed 70 selfloop flow, removed 3 redundant places. [2024-06-27 22:24:30,536 INFO L231 Difference]: Finished difference. Result has 388 places, 943 transitions, 17193 flow [2024-06-27 22:24:30,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=16195, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17193, PETRI_PLACES=388, PETRI_TRANSITIONS=943} [2024-06-27 22:24:30,537 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 332 predicate places. [2024-06-27 22:24:30,537 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 943 transitions, 17193 flow [2024-06-27 22:24:30,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:30,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:30,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:30,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:24:30,538 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:30,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1173823123, now seen corresponding path program 6 times [2024-06-27 22:24:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306510724] [2024-06-27 22:24:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306510724] [2024-06-27 22:24:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306510724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:32,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662378908] [2024-06-27 22:24:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:32,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:24:32,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 943 transitions, 17193 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:32,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:32,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:24:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:36,481 INFO L124 PetriNetUnfolderBase]: 8016/13117 cut-off events. [2024-06-27 22:24:36,481 INFO L125 PetriNetUnfolderBase]: For 967348/967350 co-relation queries the response was YES. [2024-06-27 22:24:36,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109370 conditions, 13117 events. 8016/13117 cut-off events. For 967348/967350 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 89613 event pairs, 1932 based on Foata normal form. 10/12815 useless extension candidates. Maximal degree in co-relation 109171. Up to 11040 conditions per place. [2024-06-27 22:24:36,672 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 869 selfloop transitions, 117 changer transitions 0/998 dead transitions. [2024-06-27 22:24:36,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 998 transitions, 19778 flow [2024-06-27 22:24:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-06-27 22:24:36,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508 [2024-06-27 22:24:36,674 INFO L175 Difference]: Start difference. First operand has 388 places, 943 transitions, 17193 flow. Second operand 10 states and 254 transitions. [2024-06-27 22:24:36,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 998 transitions, 19778 flow [2024-06-27 22:24:39,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 998 transitions, 19459 flow, removed 97 selfloop flow, removed 6 redundant places. [2024-06-27 22:24:39,535 INFO L231 Difference]: Finished difference. Result has 392 places, 952 transitions, 17410 flow [2024-06-27 22:24:39,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=16902, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17410, PETRI_PLACES=392, PETRI_TRANSITIONS=952} [2024-06-27 22:24:39,536 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 336 predicate places. [2024-06-27 22:24:39,536 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 952 transitions, 17410 flow [2024-06-27 22:24:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:39,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:39,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:39,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:24:39,536 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:39,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1086983443, now seen corresponding path program 7 times [2024-06-27 22:24:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397537148] [2024-06-27 22:24:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397537148] [2024-06-27 22:24:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397537148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:41,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:41,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140613788] [2024-06-27 22:24:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:41,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:24:41,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 952 transitions, 17410 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:41,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:41,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:24:41,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:45,590 INFO L124 PetriNetUnfolderBase]: 7998/13089 cut-off events. [2024-06-27 22:24:45,591 INFO L125 PetriNetUnfolderBase]: For 964432/964434 co-relation queries the response was YES. [2024-06-27 22:24:45,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108890 conditions, 13089 events. 7998/13089 cut-off events. For 964432/964434 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 89480 event pairs, 1882 based on Foata normal form. 10/12787 useless extension candidates. Maximal degree in co-relation 108689. Up to 10779 conditions per place. [2024-06-27 22:24:45,780 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 845 selfloop transitions, 146 changer transitions 0/1003 dead transitions. [2024-06-27 22:24:45,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1003 transitions, 19805 flow [2024-06-27 22:24:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2024-06-27 22:24:45,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512 [2024-06-27 22:24:45,782 INFO L175 Difference]: Start difference. First operand has 392 places, 952 transitions, 17410 flow. Second operand 10 states and 256 transitions. [2024-06-27 22:24:45,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1003 transitions, 19805 flow [2024-06-27 22:24:48,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1003 transitions, 19391 flow, removed 126 selfloop flow, removed 6 redundant places. [2024-06-27 22:24:48,825 INFO L231 Difference]: Finished difference. Result has 396 places, 952 transitions, 17312 flow [2024-06-27 22:24:48,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=16996, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17312, PETRI_PLACES=396, PETRI_TRANSITIONS=952} [2024-06-27 22:24:48,826 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 340 predicate places. [2024-06-27 22:24:48,826 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 952 transitions, 17312 flow [2024-06-27 22:24:48,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:48,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:48,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:48,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:24:48,827 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:48,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1445261511, now seen corresponding path program 8 times [2024-06-27 22:24:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785136025] [2024-06-27 22:24:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:24:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:24:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:24:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785136025] [2024-06-27 22:24:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785136025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:24:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:24:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:24:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635944307] [2024-06-27 22:24:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:24:50,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:24:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:24:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:24:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:24:50,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:24:50,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 952 transitions, 17312 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:50,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:24:50,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:24:50,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:24:55,111 INFO L124 PetriNetUnfolderBase]: 8027/13132 cut-off events. [2024-06-27 22:24:55,111 INFO L125 PetriNetUnfolderBase]: For 973587/973589 co-relation queries the response was YES. [2024-06-27 22:24:55,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109325 conditions, 13132 events. 8027/13132 cut-off events. For 973587/973589 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 89710 event pairs, 1890 based on Foata normal form. 4/12822 useless extension candidates. Maximal degree in co-relation 109123. Up to 10599 conditions per place. [2024-06-27 22:24:55,328 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 698 selfloop transitions, 290 changer transitions 0/1000 dead transitions. [2024-06-27 22:24:55,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1000 transitions, 19762 flow [2024-06-27 22:24:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:24:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:24:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions. [2024-06-27 22:24:55,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522 [2024-06-27 22:24:55,330 INFO L175 Difference]: Start difference. First operand has 396 places, 952 transitions, 17312 flow. Second operand 10 states and 261 transitions. [2024-06-27 22:24:55,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1000 transitions, 19762 flow [2024-06-27 22:24:58,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1000 transitions, 19361 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-27 22:24:58,435 INFO L231 Difference]: Finished difference. Result has 397 places, 955 transitions, 17606 flow [2024-06-27 22:24:58,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=16911, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17606, PETRI_PLACES=397, PETRI_TRANSITIONS=955} [2024-06-27 22:24:58,436 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 341 predicate places. [2024-06-27 22:24:58,437 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 955 transitions, 17606 flow [2024-06-27 22:24:58,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:24:58,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:24:58,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:24:58,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:24:58,437 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:24:58,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:24:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash 452882097, now seen corresponding path program 9 times [2024-06-27 22:24:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:24:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113509894] [2024-06-27 22:24:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:24:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:24:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:25:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113509894] [2024-06-27 22:25:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113509894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:00,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341360674] [2024-06-27 22:25:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:00,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:00,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:00,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:00,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:25:00,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 955 transitions, 17606 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:25:00,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:00,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:25:00,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:04,524 INFO L124 PetriNetUnfolderBase]: 8056/13173 cut-off events. [2024-06-27 22:25:04,525 INFO L125 PetriNetUnfolderBase]: For 1004314/1004316 co-relation queries the response was YES. [2024-06-27 22:25:04,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110952 conditions, 13173 events. 8056/13173 cut-off events. For 1004314/1004316 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 90004 event pairs, 1891 based on Foata normal form. 4/12863 useless extension candidates. Maximal degree in co-relation 110749. Up to 10642 conditions per place. [2024-06-27 22:25:04,745 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 713 selfloop transitions, 279 changer transitions 0/1004 dead transitions. [2024-06-27 22:25:04,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1004 transitions, 20096 flow [2024-06-27 22:25:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:25:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:25:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 262 transitions. [2024-06-27 22:25:04,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524 [2024-06-27 22:25:04,747 INFO L175 Difference]: Start difference. First operand has 397 places, 955 transitions, 17606 flow. Second operand 10 states and 262 transitions. [2024-06-27 22:25:04,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1004 transitions, 20096 flow [2024-06-27 22:25:08,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1004 transitions, 19427 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-27 22:25:08,283 INFO L231 Difference]: Finished difference. Result has 399 places, 958 transitions, 17616 flow [2024-06-27 22:25:08,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=16937, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17616, PETRI_PLACES=399, PETRI_TRANSITIONS=958} [2024-06-27 22:25:08,284 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 343 predicate places. [2024-06-27 22:25:08,284 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 958 transitions, 17616 flow [2024-06-27 22:25:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:25:08,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:25:08,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:25:08,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:25:08,285 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:25:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:25:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash 452734227, now seen corresponding path program 10 times [2024-06-27 22:25:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:25:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379177746] [2024-06-27 22:25:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:25:08,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:25:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:25:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:25:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:25:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379177746] [2024-06-27 22:25:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379177746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:25:10,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:25:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:25:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138570912] [2024-06-27 22:25:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:25:10,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:25:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:25:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:25:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:25:10,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-06-27 22:25:10,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 958 transitions, 17616 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:25:10,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:25:10,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-06-27 22:25:10,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:25:14,481 INFO L124 PetriNetUnfolderBase]: 8114/13255 cut-off events. [2024-06-27 22:25:14,481 INFO L125 PetriNetUnfolderBase]: For 1034883/1034885 co-relation queries the response was YES. [2024-06-27 22:25:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112256 conditions, 13255 events. 8114/13255 cut-off events. For 1034883/1034885 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 90462 event pairs, 1886 based on Foata normal form. 4/12945 useless extension candidates. Maximal degree in co-relation 112052. Up to 10626 conditions per place. [2024-06-27 22:25:14,706 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 715 selfloop transitions, 284 changer transitions 0/1011 dead transitions. [2024-06-27 22:25:14,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1011 transitions, 20188 flow [2024-06-27 22:25:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:25:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:25:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 263 transitions. [2024-06-27 22:25:14,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526 [2024-06-27 22:25:14,708 INFO L175 Difference]: Start difference. First operand has 399 places, 958 transitions, 17616 flow. Second operand 10 states and 263 transitions. [2024-06-27 22:25:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1011 transitions, 20188 flow