./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix055.opt.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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/mix055.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix055.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:22:18,916 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:22:18,989 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:22:18,997 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:22:18,997 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:22:19,024 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:22:19,025 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:22:19,026 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:22:19,026 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:22:19,031 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:22:19,031 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:22:19,031 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:22:19,033 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:22:19,034 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:22:19,034 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:22:19,034 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:22:19,034 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:22:19,035 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:22:19,035 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:22:19,035 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:22:19,035 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:22:19,036 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:22:19,036 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:22:19,036 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:22:19,036 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:22:19,037 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:22:19,037 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:22:19,037 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:22:19,038 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:22:19,038 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:22:19,039 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:22:19,039 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:22:19,039 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:22:19,039 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:22:19,039 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:22:19,040 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:22:19,040 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:22:19,040 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:22:19,040 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:22:19,040 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:22:19,041 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:22:19,041 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:22:19,041 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:22:19,041 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:22:19,220 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:22:19,235 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:22:19,237 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:22:19,238 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:22:19,239 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:22:19,240 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix055.opt.yml/witness.yml
[2024-06-20 19:22:19,455 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:22:19,455 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:22:19,456 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i
[2024-06-20 19:22:20,625 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:22:20,829 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:22:20,829 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i
[2024-06-20 19:22:20,840 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7c78a373/07ab6ac4679c4a7b8f3157132fe04c4d/FLAGc5b813417
[2024-06-20 19:22:20,851 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7c78a373/07ab6ac4679c4a7b8f3157132fe04c4d
[2024-06-20 19:22:20,851 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:22:20,852 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:22:20,853 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:22:20,854 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:22:20,857 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:22:20,858 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:22:19" (1/2) ...
[2024-06-20 19:22:20,859 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173419d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:22:20, skipping insertion in model container
[2024-06-20 19:22:20,859 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:22:19" (1/2) ...
[2024-06-20 19:22:20,860 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1baff66 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:22:20, skipping insertion in model container
[2024-06-20 19:22:20,860 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:22:20" (2/2) ...
[2024-06-20 19:22:20,860 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173419d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:20, skipping insertion in model container
[2024-06-20 19:22:20,861 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:22:20" (2/2) ...
[2024-06-20 19:22:20,861 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:22:20,958 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:22:20,959 INFO  L97    edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((((! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && y <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:22:20,960 INFO  L97    edCorrectnessWitness]: Location invariant before [L843-L843] (((((((((((((((((((((! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && y <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:22:20,961 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] (((((((((((((((((((((! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && y <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:22:20,962 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] (((((((((((((((((((((! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && y <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:22:20,963 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:22:20,963 INFO  L106   edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1;
[2024-06-20 19:22:21,004 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:22:21,290 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:22:21,304 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:22:21,778 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:22:21,813 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:22:21,813 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21 WrapperNode
[2024-06-20 19:22:21,813 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:22:21,814 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:22:21,815 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:22:21,815 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:22:21,819 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:21,873 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,104 INFO  L138                Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156
[2024-06-20 19:22:22,105 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:22:22,106 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:22:22,106 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:22:22,106 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:22:22,115 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,115 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,160 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,303 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-20 19:22:22,303 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,304 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,385 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,388 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,417 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,424 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,471 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:22:22,472 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:22:22,472 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:22:22,473 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:22:22,473 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (1/1) ...
[2024-06-20 19:22:22,477 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:22:22,484 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:22:22,538 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-20 19:22:22,552 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-20 19:22:22,582 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:22:22,582 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:22:22,582 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:22:22,582 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:22:22,583 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:22:22,583 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:22:22,583 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:22:22,583 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:22:22,583 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-20 19:22:22,584 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-20 19:22:22,584 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:22:22,584 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:22:22,584 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:22:22,585 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:22:22,586 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:22:22,718 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:22:22,719 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:22:24,666 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:22:24,667 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:22:25,012 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:22:25,012 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:22:25,013 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:22:25 BoogieIcfgContainer
[2024-06-20 19:22:25,013 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:22:25,016 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:22:25,016 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:22:25,019 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:22:25,019 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:22:19" (1/4) ...
[2024-06-20 19:22:25,019 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653b550d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:22:25, skipping insertion in model container
[2024-06-20 19:22:25,019 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:22:20" (2/4) ...
[2024-06-20 19:22:25,020 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653b550d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:22:25, skipping insertion in model container
[2024-06-20 19:22:25,020 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:22:21" (3/4) ...
[2024-06-20 19:22:25,020 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653b550d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:22:25, skipping insertion in model container
[2024-06-20 19:22:25,020 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:22:25" (4/4) ...
[2024-06-20 19:22:25,021 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix055.opt.i
[2024-06-20 19:22:25,054 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:22:25,055 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-20 19:22:25,055 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:22:25,161 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:22:25,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:22:25,272 INFO  L124   PetriNetUnfolderBase]: 0/47 cut-off events.
[2024-06-20 19:22:25,272 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:22:25,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:22:25,275 INFO  L82        GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:22:25,277 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow
[2024-06-20 19:22:25,284 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:22:25,288 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;@246969cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:22:25,289 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-20 19:22:25,295 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:22:25,295 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:22:25,295 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:22:25,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:25,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:22:25,296 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:22:25,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:25,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 381650207, now seen corresponding path program 1 times
[2024-06-20 19:22:25,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:25,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683308496]
[2024-06-20 19:22:25,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:25,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:25,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:32,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:22:32,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:32,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683308496]
[2024-06-20 19:22:32,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683308496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:32,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:32,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:22:32,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9291359]
[2024-06-20 19:22:32,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:32,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:22:32,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:32,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:22:32,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:22:32,587 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-06-20 19:22:32,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:32,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:32,590 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-06-20 19:22:32,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:35,887 INFO  L124   PetriNetUnfolderBase]: 6405/9062 cut-off events.
[2024-06-20 19:22:35,888 INFO  L125   PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES.
[2024-06-20 19:22:35,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18142 conditions, 9062 events. 6405/9062 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 50644 event pairs, 4800 based on Foata normal form. 1/8896 useless extension candidates. Maximal degree in co-relation 18129. Up to 8771 conditions per place. 
[2024-06-20 19:22:35,948 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2024-06-20 19:22:35,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 223 flow
[2024-06-20 19:22:35,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:22:35,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:22:35,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2024-06-20 19:22:35,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6209150326797386
[2024-06-20 19:22:35,960 INFO  L175             Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 95 transitions.
[2024-06-20 19:22:35,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 223 flow
[2024-06-20 19:22:35,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:22:35,968 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 129 flow
[2024-06-20 19:22:35,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-20 19:22:35,973 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places.
[2024-06-20 19:22:35,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 129 flow
[2024-06-20 19:22:35,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:35,974 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:35,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:35,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:22:35,975 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:22:35,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:35,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693662526, now seen corresponding path program 1 times
[2024-06-20 19:22:35,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:35,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71286697]
[2024-06-20 19:22:35,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:35,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:36,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:41,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:22:41,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:41,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71286697]
[2024-06-20 19:22:41,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71286697] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:41,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:41,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:22:41,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692003175]
[2024-06-20 19:22:41,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:41,573 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:22:41,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:41,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:22:41,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:22:41,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:22:41,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 129 flow. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:41,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:41,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:22:41,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:45,192 INFO  L124   PetriNetUnfolderBase]: 7493/10322 cut-off events.
[2024-06-20 19:22:45,192 INFO  L125   PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES.
[2024-06-20 19:22:45,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23740 conditions, 10322 events. 7493/10322 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 55776 event pairs, 5002 based on Foata normal form. 4/10307 useless extension candidates. Maximal degree in co-relation 23728. Up to 10194 conditions per place. 
[2024-06-20 19:22:45,243 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 52 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2024-06-20 19:22:45,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 317 flow
[2024-06-20 19:22:45,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:22:45,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:22:45,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions.
[2024-06-20 19:22:45,245 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5931372549019608
[2024-06-20 19:22:45,245 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 129 flow. Second operand 4 states and 121 transitions.
[2024-06-20 19:22:45,245 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 317 flow
[2024-06-20 19:22:45,246 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:22:45,247 INFO  L231             Difference]: Finished difference. Result has 56 places, 49 transitions, 177 flow
[2024-06-20 19:22:45,247 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=49}
[2024-06-20 19:22:45,248 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places.
[2024-06-20 19:22:45,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 177 flow
[2024-06-20 19:22:45,248 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:45,248 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:45,249 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:45,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:22:45,249 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:22:45,249 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:45,249 INFO  L85        PathProgramCache]: Analyzing trace with hash 963931870, now seen corresponding path program 1 times
[2024-06-20 19:22:45,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:45,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070256970]
[2024-06-20 19:22:45,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:45,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:45,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:50,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:22:50,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:50,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070256970]
[2024-06-20 19:22:50,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070256970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:50,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:50,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:22:50,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275495715]
[2024-06-20 19:22:50,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:50,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:22:50,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:50,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:22:50,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:22:50,767 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:22:50,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 177 flow. Second operand  has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:50,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:50,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:22:50,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:54,227 INFO  L124   PetriNetUnfolderBase]: 7511/10346 cut-off events.
[2024-06-20 19:22:54,227 INFO  L125   PetriNetUnfolderBase]: For 5962/5962 co-relation queries the response was YES.
[2024-06-20 19:22:54,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26675 conditions, 10346 events. 7511/10346 cut-off events. For 5962/5962 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 55986 event pairs, 3766 based on Foata normal form. 7/10332 useless extension candidates. Maximal degree in co-relation 26661. Up to 10115 conditions per place. 
[2024-06-20 19:22:54,269 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 70 selfloop transitions, 21 changer transitions 0/99 dead transitions.
[2024-06-20 19:22:54,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 533 flow
[2024-06-20 19:22:54,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:22:54,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:22:54,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions.
[2024-06-20 19:22:54,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6235294117647059
[2024-06-20 19:22:54,275 INFO  L175             Difference]: Start difference. First operand has 56 places, 49 transitions, 177 flow. Second operand 5 states and 159 transitions.
[2024-06-20 19:22:54,275 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 533 flow
[2024-06-20 19:22:54,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 514 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-20 19:22:54,282 INFO  L231             Difference]: Finished difference. Result has 61 places, 63 transitions, 308 flow
[2024-06-20 19:22:54,282 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=61, PETRI_TRANSITIONS=63}
[2024-06-20 19:22:54,283 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places.
[2024-06-20 19:22:54,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 308 flow
[2024-06-20 19:22:54,283 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:54,283 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:54,283 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:54,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:22:54,284 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:22:54,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:54,284 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376156069, now seen corresponding path program 1 times
[2024-06-20 19:22:54,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:54,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870891475]
[2024-06-20 19:22:54,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:54,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:54,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:00,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:23:00,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:00,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870891475]
[2024-06-20 19:23:00,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870891475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:00,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:00,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:23:00,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301850537]
[2024-06-20 19:23:00,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:00,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:23:00,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:00,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:23:00,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:23:00,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:23:00,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 308 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-20 19:23:00,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:00,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:23:00,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:04,188 INFO  L124   PetriNetUnfolderBase]: 7653/10568 cut-off events.
[2024-06-20 19:23:04,189 INFO  L125   PetriNetUnfolderBase]: For 14677/14696 co-relation queries the response was YES.
[2024-06-20 19:23:04,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32155 conditions, 10568 events. 7653/10568 cut-off events. For 14677/14696 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 57340 event pairs, 2959 based on Foata normal form. 48/10595 useless extension candidates. Maximal degree in co-relation 32138. Up to 10107 conditions per place. 
[2024-06-20 19:23:04,283 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 80 selfloop transitions, 24 changer transitions 0/112 dead transitions.
[2024-06-20 19:23:04,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 688 flow
[2024-06-20 19:23:04,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:23:04,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:23:04,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions.
[2024-06-20 19:23:04,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6078431372549019
[2024-06-20 19:23:04,288 INFO  L175             Difference]: Start difference. First operand has 61 places, 63 transitions, 308 flow. Second operand 6 states and 186 transitions.
[2024-06-20 19:23:04,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 688 flow
[2024-06-20 19:23:04,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 676 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-20 19:23:04,296 INFO  L231             Difference]: Finished difference. Result has 66 places, 65 transitions, 377 flow
[2024-06-20 19:23:04,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=66, PETRI_TRANSITIONS=65}
[2024-06-20 19:23:04,298 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2024-06-20 19:23:04,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 377 flow
[2024-06-20 19:23:04,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-20 19:23:04,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:04,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:04,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:23:04,298 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:04,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:04,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -1949603560, now seen corresponding path program 1 times
[2024-06-20 19:23:04,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:04,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415074859]
[2024-06-20 19:23:04,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:04,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:04,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:19,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:23:19,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:19,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415074859]
[2024-06-20 19:23:19,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415074859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:19,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:19,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:23:19,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277275785]
[2024-06-20 19:23:19,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:19,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:23:19,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:19,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:23:19,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:23:19,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:23:19,822 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 377 flow. Second operand  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:19,822 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:19,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:23:19,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:23,014 INFO  L124   PetriNetUnfolderBase]: 6546/9312 cut-off events.
[2024-06-20 19:23:23,015 INFO  L125   PetriNetUnfolderBase]: For 18288/18316 co-relation queries the response was YES.
[2024-06-20 19:23:23,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30405 conditions, 9312 events. 6546/9312 cut-off events. For 18288/18316 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 52358 event pairs, 3025 based on Foata normal form. 3/9299 useless extension candidates. Maximal degree in co-relation 30384. Up to 8977 conditions per place. 
[2024-06-20 19:23:23,057 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 64 selfloop transitions, 10 changer transitions 0/82 dead transitions.
[2024-06-20 19:23:23,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 569 flow
[2024-06-20 19:23:23,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:23:23,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:23:23,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions.
[2024-06-20 19:23:23,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49019607843137253
[2024-06-20 19:23:23,058 INFO  L175             Difference]: Start difference. First operand has 66 places, 65 transitions, 377 flow. Second operand 5 states and 125 transitions.
[2024-06-20 19:23:23,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 569 flow
[2024-06-20 19:23:23,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 508 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:23:23,065 INFO  L231             Difference]: Finished difference. Result has 67 places, 65 transitions, 347 flow
[2024-06-20 19:23:23,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=67, PETRI_TRANSITIONS=65}
[2024-06-20 19:23:23,066 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2024-06-20 19:23:23,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 347 flow
[2024-06-20 19:23:23,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:23,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:23,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:23,067 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:23:23,067 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:23,067 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:23,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1799219115, now seen corresponding path program 1 times
[2024-06-20 19:23:23,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:23,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224813726]
[2024-06-20 19:23:23,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:23,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:23,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:40,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:23:40,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:40,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224813726]
[2024-06-20 19:23:40,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224813726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:40,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:40,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:23:40,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130667154]
[2024-06-20 19:23:40,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:40,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:23:40,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:40,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:23:40,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:23:40,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:23:40,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 347 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:40,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:40,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:23:40,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:44,682 INFO  L124   PetriNetUnfolderBase]: 7657/10574 cut-off events.
[2024-06-20 19:23:44,683 INFO  L125   PetriNetUnfolderBase]: For 24864/24884 co-relation queries the response was YES.
[2024-06-20 19:23:44,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35121 conditions, 10574 events. 7657/10574 cut-off events. For 24864/24884 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 57427 event pairs, 3614 based on Foata normal form. 24/10584 useless extension candidates. Maximal degree in co-relation 35098. Up to 10337 conditions per place. 
[2024-06-20 19:23:44,736 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 67 selfloop transitions, 25 changer transitions 0/99 dead transitions.
[2024-06-20 19:23:44,736 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 668 flow
[2024-06-20 19:23:44,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:23:44,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:23:44,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-06-20 19:23:44,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5032679738562091
[2024-06-20 19:23:44,738 INFO  L175             Difference]: Start difference. First operand has 67 places, 65 transitions, 347 flow. Second operand 6 states and 154 transitions.
[2024-06-20 19:23:44,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 668 flow
[2024-06-20 19:23:44,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 639 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-20 19:23:44,745 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 414 flow
[2024-06-20 19:23:44,745 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-20 19:23:44,745 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places.
[2024-06-20 19:23:44,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 414 flow
[2024-06-20 19:23:44,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:44,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:44,746 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:44,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:23:44,746 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:44,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:44,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -963230025, now seen corresponding path program 2 times
[2024-06-20 19:23:44,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:44,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575726766]
[2024-06-20 19:23:44,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:44,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:44,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:24:01,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:24:01,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:24:01,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575726766]
[2024-06-20 19:24:01,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575726766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:01,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:01,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:24:01,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709829628]
[2024-06-20 19:24:01,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:01,513 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:24:01,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:24:01,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:24:01,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:24:01,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:24:01,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 414 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:01,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:01,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:24:01,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:05,429 INFO  L124   PetriNetUnfolderBase]: 7612/10501 cut-off events.
[2024-06-20 19:24:05,430 INFO  L125   PetriNetUnfolderBase]: For 29616/29644 co-relation queries the response was YES.
[2024-06-20 19:24:05,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35847 conditions, 10501 events. 7612/10501 cut-off events. For 29616/29644 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 56667 event pairs, 3628 based on Foata normal form. 24/10505 useless extension candidates. Maximal degree in co-relation 35824. Up to 10268 conditions per place. 
[2024-06-20 19:24:05,474 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 60 selfloop transitions, 26 changer transitions 0/93 dead transitions.
[2024-06-20 19:24:05,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 648 flow
[2024-06-20 19:24:05,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:24:05,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:24:05,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions.
[2024-06-20 19:24:05,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4869281045751634
[2024-06-20 19:24:05,476 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 414 flow. Second operand 6 states and 149 transitions.
[2024-06-20 19:24:05,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 648 flow
[2024-06-20 19:24:05,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 605 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-20 19:24:05,485 INFO  L231             Difference]: Finished difference. Result has 72 places, 69 transitions, 434 flow
[2024-06-20 19:24:05,485 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=72, PETRI_TRANSITIONS=69}
[2024-06-20 19:24:05,486 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places.
[2024-06-20 19:24:05,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 434 flow
[2024-06-20 19:24:05,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:05,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:05,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:05,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:24:05,487 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:05,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:05,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 236161693, now seen corresponding path program 1 times
[2024-06-20 19:24:05,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:24:05,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990083434]
[2024-06-20 19:24:05,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:24:05,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:24:05,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:24:23,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:24:23,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:24:23,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990083434]
[2024-06-20 19:24:23,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990083434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:23,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:23,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:24:23,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586007231]
[2024-06-20 19:24:23,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:23,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:24:23,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:24:23,121 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:24:23,121 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:24:23,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:24:23,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 434 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:23,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:23,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:24:23,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:27,519 INFO  L124   PetriNetUnfolderBase]: 8299/11564 cut-off events.
[2024-06-20 19:24:27,519 INFO  L125   PetriNetUnfolderBase]: For 36466/36466 co-relation queries the response was YES.
[2024-06-20 19:24:27,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39574 conditions, 11564 events. 8299/11564 cut-off events. For 36466/36466 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 62715 event pairs, 3868 based on Foata normal form. 6/11566 useless extension candidates. Maximal degree in co-relation 39550. Up to 11267 conditions per place. 
[2024-06-20 19:24:27,576 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 84 selfloop transitions, 17 changer transitions 0/108 dead transitions.
[2024-06-20 19:24:27,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 108 transitions, 773 flow
[2024-06-20 19:24:27,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:24:27,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:24:27,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions.
[2024-06-20 19:24:27,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4677871148459384
[2024-06-20 19:24:27,580 INFO  L175             Difference]: Start difference. First operand has 72 places, 69 transitions, 434 flow. Second operand 7 states and 167 transitions.
[2024-06-20 19:24:27,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 108 transitions, 773 flow
[2024-06-20 19:24:27,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 682 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-20 19:24:27,601 INFO  L231             Difference]: Finished difference. Result has 74 places, 76 transitions, 455 flow
[2024-06-20 19:24:27,601 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=74, PETRI_TRANSITIONS=76}
[2024-06-20 19:24:27,601 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places.
[2024-06-20 19:24:27,602 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 455 flow
[2024-06-20 19:24:27,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:27,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:27,602 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:27,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:24:27,602 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:27,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:27,603 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004982215, now seen corresponding path program 1 times
[2024-06-20 19:24:27,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:24:27,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155941417]
[2024-06-20 19:24:27,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:24:27,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:24:27,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:24:46,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:24:46,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:24:46,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155941417]
[2024-06-20 19:24:46,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155941417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:46,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:46,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:24:46,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433403721]
[2024-06-20 19:24:46,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:46,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:24:46,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:24:46,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:24:46,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:24:46,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:24:46,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 455 flow. Second operand  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-20 19:24:46,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:46,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:24:46,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:50,761 INFO  L124   PetriNetUnfolderBase]: 8292/11709 cut-off events.
[2024-06-20 19:24:50,762 INFO  L125   PetriNetUnfolderBase]: For 44584/44584 co-relation queries the response was YES.
[2024-06-20 19:24:50,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42299 conditions, 11709 events. 8292/11709 cut-off events. For 44584/44584 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 64544 event pairs, 3960 based on Foata normal form. 2/11707 useless extension candidates. Maximal degree in co-relation 42273. Up to 11309 conditions per place. 
[2024-06-20 19:24:50,820 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 77 selfloop transitions, 10 changer transitions 0/94 dead transitions.
[2024-06-20 19:24:50,821 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 697 flow
[2024-06-20 19:24:50,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:24:50,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:24:50,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions.
[2024-06-20 19:24:50,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4588235294117647
[2024-06-20 19:24:50,823 INFO  L175             Difference]: Start difference. First operand has 74 places, 76 transitions, 455 flow. Second operand 5 states and 117 transitions.
[2024-06-20 19:24:50,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 697 flow
[2024-06-20 19:24:50,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 649 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:24:50,845 INFO  L231             Difference]: Finished difference. Result has 75 places, 80 transitions, 476 flow
[2024-06-20 19:24:50,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=75, PETRI_TRANSITIONS=80}
[2024-06-20 19:24:50,845 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places.
[2024-06-20 19:24:50,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 476 flow
[2024-06-20 19:24:50,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-20 19:24:50,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:50,846 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:50,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:24:50,846 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:50,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:50,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139724235, now seen corresponding path program 1 times
[2024-06-20 19:24:50,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:24:50,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709454370]
[2024-06-20 19:24:50,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:24:50,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:24:50,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:10,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:25:10,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:10,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709454370]
[2024-06-20 19:25:10,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709454370] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:10,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:10,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:10,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294622911]
[2024-06-20 19:25:10,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:10,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:10,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:10,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:10,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:10,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:25:10,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 476 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:25:10,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:10,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:25:10,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:15,101 INFO  L124   PetriNetUnfolderBase]: 8278/11825 cut-off events.
[2024-06-20 19:25:15,102 INFO  L125   PetriNetUnfolderBase]: For 55845/55845 co-relation queries the response was YES.
[2024-06-20 19:25:15,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45004 conditions, 11825 events. 8278/11825 cut-off events. For 55845/55845 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 66169 event pairs, 3930 based on Foata normal form. 4/11825 useless extension candidates. Maximal degree in co-relation 44977. Up to 11273 conditions per place. 
[2024-06-20 19:25:15,160 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 82 selfloop transitions, 14 changer transitions 0/103 dead transitions.
[2024-06-20 19:25:15,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 754 flow
[2024-06-20 19:25:15,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:25:15,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:25:15,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-06-20 19:25:15,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45098039215686275
[2024-06-20 19:25:15,162 INFO  L175             Difference]: Start difference. First operand has 75 places, 80 transitions, 476 flow. Second operand 6 states and 138 transitions.
[2024-06-20 19:25:15,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 754 flow
[2024-06-20 19:25:15,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 715 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-20 19:25:15,189 INFO  L231             Difference]: Finished difference. Result has 78 places, 84 transitions, 520 flow
[2024-06-20 19:25:15,189 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=78, PETRI_TRANSITIONS=84}
[2024-06-20 19:25:15,190 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places.
[2024-06-20 19:25:15,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 520 flow
[2024-06-20 19:25:15,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:25:15,190 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:15,191 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:15,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:25:15,191 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:15,191 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:15,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 538666626, now seen corresponding path program 1 times
[2024-06-20 19:25:15,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:15,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3965381]
[2024-06-20 19:25:15,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:15,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:15,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:31,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:25:31,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:31,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3965381]
[2024-06-20 19:25:31,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3965381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:31,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:31,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:31,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463577995]
[2024-06-20 19:25:31,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:31,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:31,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:31,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:31,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:31,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:25:31,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 520 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:31,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:31,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:25:31,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:36,666 INFO  L124   PetriNetUnfolderBase]: 9647/13329 cut-off events.
[2024-06-20 19:25:36,666 INFO  L125   PetriNetUnfolderBase]: For 86379/86471 co-relation queries the response was YES.
[2024-06-20 19:25:36,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55105 conditions, 13329 events. 9647/13329 cut-off events. For 86379/86471 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 73518 event pairs, 3819 based on Foata normal form. 54/13372 useless extension candidates. Maximal degree in co-relation 55077. Up to 12454 conditions per place. 
[2024-06-20 19:25:36,740 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 93 selfloop transitions, 32 changer transitions 0/133 dead transitions.
[2024-06-20 19:25:36,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 1002 flow
[2024-06-20 19:25:36,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:25:36,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:25:36,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions.
[2024-06-20 19:25:36,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5070028011204482
[2024-06-20 19:25:36,744 INFO  L175             Difference]: Start difference. First operand has 78 places, 84 transitions, 520 flow. Second operand 7 states and 181 transitions.
[2024-06-20 19:25:36,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 1002 flow
[2024-06-20 19:25:36,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 949 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-20 19:25:36,769 INFO  L231             Difference]: Finished difference. Result has 81 places, 88 transitions, 600 flow
[2024-06-20 19:25:36,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=600, PETRI_PLACES=81, PETRI_TRANSITIONS=88}
[2024-06-20 19:25:36,770 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places.
[2024-06-20 19:25:36,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 600 flow
[2024-06-20 19:25:36,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:36,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:36,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:36,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:25:36,771 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:36,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:36,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 538727076, now seen corresponding path program 2 times
[2024-06-20 19:25:36,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:36,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237310012]
[2024-06-20 19:25:36,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:36,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:36,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:52,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:25:52,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:52,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237310012]
[2024-06-20 19:25:52,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237310012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:52,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:52,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:52,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301145832]
[2024-06-20 19:25:52,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:52,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:52,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:52,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:52,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:53,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:25:53,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 600 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:53,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:53,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:25:53,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:58,067 INFO  L124   PetriNetUnfolderBase]: 9760/13508 cut-off events.
[2024-06-20 19:25:58,068 INFO  L125   PetriNetUnfolderBase]: For 103050/103142 co-relation queries the response was YES.
[2024-06-20 19:25:58,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57911 conditions, 13508 events. 9760/13508 cut-off events. For 103050/103142 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 74401 event pairs, 4384 based on Foata normal form. 87/13574 useless extension candidates. Maximal degree in co-relation 57882. Up to 13026 conditions per place. 
[2024-06-20 19:25:58,140 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 90 selfloop transitions, 31 changer transitions 0/129 dead transitions.
[2024-06-20 19:25:58,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 129 transitions, 980 flow
[2024-06-20 19:25:58,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:25:58,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:25:58,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions.
[2024-06-20 19:25:58,144 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4957983193277311
[2024-06-20 19:25:58,144 INFO  L175             Difference]: Start difference. First operand has 81 places, 88 transitions, 600 flow. Second operand 7 states and 177 transitions.
[2024-06-20 19:25:58,144 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 129 transitions, 980 flow
[2024-06-20 19:25:58,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 129 transitions, 931 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-20 19:25:58,195 INFO  L231             Difference]: Finished difference. Result has 85 places, 91 transitions, 668 flow
[2024-06-20 19:25:58,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=668, PETRI_PLACES=85, PETRI_TRANSITIONS=91}
[2024-06-20 19:25:58,196 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places.
[2024-06-20 19:25:58,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 668 flow
[2024-06-20 19:25:58,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:58,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:58,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:58,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:25:58,197 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:58,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:58,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -983152376, now seen corresponding path program 1 times
[2024-06-20 19:25:58,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:58,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592205496]
[2024-06-20 19:25:58,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:58,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:58,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:19,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:26:19,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:26:19,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592205496]
[2024-06-20 19:26:19,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592205496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:19,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:19,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:26:19,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097964849]
[2024-06-20 19:26:19,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:19,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:26:19,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:26:19,696 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:26:19,696 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:26:19,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:26:19,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 668 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:19,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:19,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:26:19,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:26:24,691 INFO  L124   PetriNetUnfolderBase]: 10097/13918 cut-off events.
[2024-06-20 19:26:24,691 INFO  L125   PetriNetUnfolderBase]: For 116458/116464 co-relation queries the response was YES.
[2024-06-20 19:26:24,714 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61442 conditions, 13918 events. 10097/13918 cut-off events. For 116458/116464 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 74841 event pairs, 4586 based on Foata normal form. 6/13919 useless extension candidates. Maximal degree in co-relation 61411. Up to 13728 conditions per place. 
[2024-06-20 19:26:24,766 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 98 selfloop transitions, 21 changer transitions 0/125 dead transitions.
[2024-06-20 19:26:24,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 125 transitions, 1108 flow
[2024-06-20 19:26:24,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:26:24,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:26:24,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions.
[2024-06-20 19:26:24,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46405228758169936
[2024-06-20 19:26:24,768 INFO  L175             Difference]: Start difference. First operand has 85 places, 91 transitions, 668 flow. Second operand 6 states and 142 transitions.
[2024-06-20 19:26:24,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 125 transitions, 1108 flow
[2024-06-20 19:26:24,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 1027 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 19:26:24,860 INFO  L231             Difference]: Finished difference. Result has 86 places, 99 transitions, 734 flow
[2024-06-20 19:26:24,860 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=86, PETRI_TRANSITIONS=99}
[2024-06-20 19:26:24,861 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 32 predicate places.
[2024-06-20 19:26:24,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 99 transitions, 734 flow
[2024-06-20 19:26:24,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:24,861 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:26:24,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:26:24,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:26:24,862 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:26:24,862 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:26:24,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 822638588, now seen corresponding path program 1 times
[2024-06-20 19:26:24,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:26:24,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130430527]
[2024-06-20 19:26:24,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:26:24,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:26:24,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:46,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:26:46,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:26:46,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130430527]
[2024-06-20 19:26:46,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130430527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:46,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:46,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:26:46,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128186535]
[2024-06-20 19:26:46,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:46,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:26:46,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:26:46,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:26:46,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:26:46,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:26:46,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 99 transitions, 734 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:46,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:46,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:26:46,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:26:51,611 INFO  L124   PetriNetUnfolderBase]: 10155/13971 cut-off events.
[2024-06-20 19:26:51,612 INFO  L125   PetriNetUnfolderBase]: For 136978/136987 co-relation queries the response was YES.
[2024-06-20 19:26:51,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64457 conditions, 13971 events. 10155/13971 cut-off events. For 136978/136987 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 74726 event pairs, 4326 based on Foata normal form. 8/13963 useless extension candidates. Maximal degree in co-relation 64425. Up to 13591 conditions per place. 
[2024-06-20 19:26:51,682 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 105 selfloop transitions, 37 changer transitions 0/148 dead transitions.
[2024-06-20 19:26:51,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 148 transitions, 1204 flow
[2024-06-20 19:26:51,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:26:51,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:26:51,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions.
[2024-06-20 19:26:51,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4681372549019608
[2024-06-20 19:26:51,686 INFO  L175             Difference]: Start difference. First operand has 86 places, 99 transitions, 734 flow. Second operand 8 states and 191 transitions.
[2024-06-20 19:26:51,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 148 transitions, 1204 flow
[2024-06-20 19:26:51,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 148 transitions, 1158 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-20 19:26:51,752 INFO  L231             Difference]: Finished difference. Result has 93 places, 107 transitions, 865 flow
[2024-06-20 19:26:51,752 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=865, PETRI_PLACES=93, PETRI_TRANSITIONS=107}
[2024-06-20 19:26:51,753 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places.
[2024-06-20 19:26:51,753 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 107 transitions, 865 flow
[2024-06-20 19:26:51,754 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:51,754 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:26:51,754 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:26:51,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:26:51,754 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:26:51,754 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:26:51,754 INFO  L85        PathProgramCache]: Analyzing trace with hash -682126306, now seen corresponding path program 2 times
[2024-06-20 19:26:51,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:26:51,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184276525]
[2024-06-20 19:26:51,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:26:51,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:26:51,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:27:12,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:27:12,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:27:12,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184276525]
[2024-06-20 19:27:12,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184276525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:27:12,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:27:12,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:27:12,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788893405]
[2024-06-20 19:27:12,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:27:12,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:27:12,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:27:12,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:27:12,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:27:13,102 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:27:13,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 107 transitions, 865 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:13,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:13,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:27:13,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:18,206 INFO  L124   PetriNetUnfolderBase]: 10140/13950 cut-off events.
[2024-06-20 19:27:18,206 INFO  L125   PetriNetUnfolderBase]: For 155483/155492 co-relation queries the response was YES.
[2024-06-20 19:27:18,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67056 conditions, 13950 events. 10140/13950 cut-off events. For 155483/155492 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 74713 event pairs, 4323 based on Foata normal form. 8/13942 useless extension candidates. Maximal degree in co-relation 67021. Up to 13570 conditions per place. 
[2024-06-20 19:27:18,284 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 107 selfloop transitions, 45 changer transitions 0/158 dead transitions.
[2024-06-20 19:27:18,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 158 transitions, 1401 flow
[2024-06-20 19:27:18,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:27:18,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:27:18,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions.
[2024-06-20 19:27:18,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4681372549019608
[2024-06-20 19:27:18,288 INFO  L175             Difference]: Start difference. First operand has 93 places, 107 transitions, 865 flow. Second operand 8 states and 191 transitions.
[2024-06-20 19:27:18,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 158 transitions, 1401 flow
[2024-06-20 19:27:18,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1281 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-20 19:27:18,360 INFO  L231             Difference]: Finished difference. Result has 97 places, 118 transitions, 994 flow
[2024-06-20 19:27:18,360 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=97, PETRI_TRANSITIONS=118}
[2024-06-20 19:27:18,361 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places.
[2024-06-20 19:27:18,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 118 transitions, 994 flow
[2024-06-20 19:27:18,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:18,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:18,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:18,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:27:18,362 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:18,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:18,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -560293674, now seen corresponding path program 3 times
[2024-06-20 19:27:18,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:27:18,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436502969]
[2024-06-20 19:27:18,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:27:18,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:27:18,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:27:39,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:27:39,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:27:39,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436502969]
[2024-06-20 19:27:39,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436502969] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:27:39,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:27:39,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:27:39,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109569606]
[2024-06-20 19:27:39,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:27:39,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:27:39,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:27:39,846 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:27:39,846 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:27:40,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:27:40,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 118 transitions, 994 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:40,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:40,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:27:40,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:45,365 INFO  L124   PetriNetUnfolderBase]: 10217/14085 cut-off events.
[2024-06-20 19:27:45,365 INFO  L125   PetriNetUnfolderBase]: For 174923/174932 co-relation queries the response was YES.
[2024-06-20 19:27:45,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69715 conditions, 14085 events. 10217/14085 cut-off events. For 174923/174932 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 75763 event pairs, 3889 based on Foata normal form. 8/14077 useless extension candidates. Maximal degree in co-relation 69678. Up to 13409 conditions per place. 
[2024-06-20 19:27:45,446 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 105 selfloop transitions, 56 changer transitions 0/167 dead transitions.
[2024-06-20 19:27:45,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 167 transitions, 1500 flow
[2024-06-20 19:27:45,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:27:45,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:27:45,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions.
[2024-06-20 19:27:45,450 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47794117647058826
[2024-06-20 19:27:45,450 INFO  L175             Difference]: Start difference. First operand has 97 places, 118 transitions, 994 flow. Second operand 8 states and 195 transitions.
[2024-06-20 19:27:45,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 167 transitions, 1500 flow
[2024-06-20 19:27:45,572 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 167 transitions, 1404 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-20 19:27:45,577 INFO  L231             Difference]: Finished difference. Result has 103 places, 123 transitions, 1113 flow
[2024-06-20 19:27:45,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1113, PETRI_PLACES=103, PETRI_TRANSITIONS=123}
[2024-06-20 19:27:45,589 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places.
[2024-06-20 19:27:45,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 123 transitions, 1113 flow
[2024-06-20 19:27:45,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:45,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:45,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:45,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:27:45,593 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:45,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:45,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -971724536, now seen corresponding path program 2 times
[2024-06-20 19:27:45,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:27:45,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343107963]
[2024-06-20 19:27:45,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:27:45,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:27:45,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:06,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:28:06,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:28:06,474 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343107963]
[2024-06-20 19:28:06,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343107963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:06,474 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:06,474 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:06,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986921702]
[2024-06-20 19:28:06,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:06,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:06,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:28:06,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:06,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:06,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:28:06,592 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 1113 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:06,592 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:06,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:28:06,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:11,791 INFO  L124   PetriNetUnfolderBase]: 10210/14091 cut-off events.
[2024-06-20 19:28:11,791 INFO  L125   PetriNetUnfolderBase]: For 195560/195575 co-relation queries the response was YES.
[2024-06-20 19:28:11,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 71728 conditions, 14091 events. 10210/14091 cut-off events. For 195560/195575 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 75736 event pairs, 4314 based on Foata normal form. 12/14096 useless extension candidates. Maximal degree in co-relation 71689. Up to 13901 conditions per place. 
[2024-06-20 19:28:11,883 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 114 selfloop transitions, 21 changer transitions 0/141 dead transitions.
[2024-06-20 19:28:11,883 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 141 transitions, 1429 flow
[2024-06-20 19:28:11,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:28:11,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:28:11,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions.
[2024-06-20 19:28:11,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43790849673202614
[2024-06-20 19:28:11,886 INFO  L175             Difference]: Start difference. First operand has 103 places, 123 transitions, 1113 flow. Second operand 6 states and 134 transitions.
[2024-06-20 19:28:11,886 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 141 transitions, 1429 flow
[2024-06-20 19:28:12,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 141 transitions, 1272 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-20 19:28:12,006 INFO  L231             Difference]: Finished difference. Result has 104 places, 123 transitions, 1007 flow
[2024-06-20 19:28:12,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1007, PETRI_PLACES=104, PETRI_TRANSITIONS=123}
[2024-06-20 19:28:12,007 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places.
[2024-06-20 19:28:12,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 123 transitions, 1007 flow
[2024-06-20 19:28:12,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:12,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:12,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:12,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:28:12,008 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:28:12,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:12,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -977432504, now seen corresponding path program 1 times
[2024-06-20 19:28:12,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:28:12,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196735630]
[2024-06-20 19:28:12,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:12,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:28:12,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:25,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:28:25,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:28:25,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196735630]
[2024-06-20 19:28:25,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196735630] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:25,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:25,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:25,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172388232]
[2024-06-20 19:28:25,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:25,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:25,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:28:25,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:25,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:25,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:28:25,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 123 transitions, 1007 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:28:25,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:25,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:28:25,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:30,123 INFO  L124   PetriNetUnfolderBase]: 8831/12505 cut-off events.
[2024-06-20 19:28:30,124 INFO  L125   PetriNetUnfolderBase]: For 177847/177853 co-relation queries the response was YES.
[2024-06-20 19:28:30,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63477 conditions, 12505 events. 8831/12505 cut-off events. For 177847/177853 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 69529 event pairs, 3564 based on Foata normal form. 6/12506 useless extension candidates. Maximal degree in co-relation 63437. Up to 12081 conditions per place. 
[2024-06-20 19:28:30,199 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 125 selfloop transitions, 23 changer transitions 0/155 dead transitions.
[2024-06-20 19:28:30,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 155 transitions, 1530 flow
[2024-06-20 19:28:30,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:28:30,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:28:30,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions.
[2024-06-20 19:28:30,208 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43977591036414565
[2024-06-20 19:28:30,208 INFO  L175             Difference]: Start difference. First operand has 104 places, 123 transitions, 1007 flow. Second operand 7 states and 157 transitions.
[2024-06-20 19:28:30,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 155 transitions, 1530 flow
[2024-06-20 19:28:30,316 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 155 transitions, 1470 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-20 19:28:30,319 INFO  L231             Difference]: Finished difference. Result has 107 places, 133 transitions, 1118 flow
[2024-06-20 19:28:30,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1118, PETRI_PLACES=107, PETRI_TRANSITIONS=133}
[2024-06-20 19:28:30,320 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places.
[2024-06-20 19:28:30,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 133 transitions, 1118 flow
[2024-06-20 19:28:30,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:28:30,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:30,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:30,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:28:30,321 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:28:30,321 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:30,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 630739306, now seen corresponding path program 2 times
[2024-06-20 19:28:30,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:28:30,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879671266]
[2024-06-20 19:28:30,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:30,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:28:30,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:43,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:28:43,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:28:43,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879671266]
[2024-06-20 19:28:43,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879671266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:43,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:43,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:43,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375853896]
[2024-06-20 19:28:43,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:43,860 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:43,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:28:43,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:43,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:44,034 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:28:44,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 133 transitions, 1118 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:28:44,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:44,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:28:44,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:48,363 INFO  L124   PetriNetUnfolderBase]: 8824/12497 cut-off events.
[2024-06-20 19:28:48,364 INFO  L125   PetriNetUnfolderBase]: For 199766/199772 co-relation queries the response was YES.
[2024-06-20 19:28:48,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66183 conditions, 12497 events. 8824/12497 cut-off events. For 199766/199772 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 69418 event pairs, 3567 based on Foata normal form. 6/12497 useless extension candidates. Maximal degree in co-relation 66141. Up to 12074 conditions per place. 
[2024-06-20 19:28:48,438 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 120 selfloop transitions, 23 changer transitions 0/150 dead transitions.
[2024-06-20 19:28:48,452 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 150 transitions, 1448 flow
[2024-06-20 19:28:48,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:28:48,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:28:48,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions.
[2024-06-20 19:28:48,453 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4257703081232493
[2024-06-20 19:28:48,453 INFO  L175             Difference]: Start difference. First operand has 107 places, 133 transitions, 1118 flow. Second operand 7 states and 152 transitions.
[2024-06-20 19:28:48,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 150 transitions, 1448 flow
[2024-06-20 19:28:48,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 150 transitions, 1378 flow, removed 34 selfloop flow, removed 1 redundant places.
[2024-06-20 19:28:48,591 INFO  L231             Difference]: Finished difference. Result has 113 places, 133 transitions, 1103 flow
[2024-06-20 19:28:48,591 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1103, PETRI_PLACES=113, PETRI_TRANSITIONS=133}
[2024-06-20 19:28:48,592 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places.
[2024-06-20 19:28:48,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 133 transitions, 1103 flow
[2024-06-20 19:28:48,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 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-20 19:28:48,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:48,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:48,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:28:48,593 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:28:48,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:48,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -413249248, now seen corresponding path program 1 times
[2024-06-20 19:28:48,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:28:48,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912622580]
[2024-06-20 19:28:48,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:48,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:28:48,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:10,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:29:10,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:29:10,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912622580]
[2024-06-20 19:29:10,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912622580] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:10,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:10,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:29:10,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565554780]
[2024-06-20 19:29:10,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:10,419 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:29:10,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:29:10,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:29:10,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:29:10,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:29:10,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 133 transitions, 1103 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:10,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:10,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:29:10,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:15,855 INFO  L124   PetriNetUnfolderBase]: 10274/14202 cut-off events.
[2024-06-20 19:29:15,856 INFO  L125   PetriNetUnfolderBase]: For 257946/257958 co-relation queries the response was YES.
[2024-06-20 19:29:15,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76851 conditions, 14202 events. 10274/14202 cut-off events. For 257946/257958 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 76810 event pairs, 4265 based on Foata normal form. 12/14206 useless extension candidates. Maximal degree in co-relation 76806. Up to 13757 conditions per place. 
[2024-06-20 19:29:15,949 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 129 selfloop transitions, 53 changer transitions 0/188 dead transitions.
[2024-06-20 19:29:15,950 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 1917 flow
[2024-06-20 19:29:15,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:29:15,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:29:15,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions.
[2024-06-20 19:29:15,954 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49019607843137253
[2024-06-20 19:29:15,955 INFO  L175             Difference]: Start difference. First operand has 113 places, 133 transitions, 1103 flow. Second operand 7 states and 175 transitions.
[2024-06-20 19:29:15,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 1917 flow
[2024-06-20 19:29:16,105 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 188 transitions, 1866 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:29:16,107 INFO  L231             Difference]: Finished difference. Result has 117 places, 151 transitions, 1430 flow
[2024-06-20 19:29:16,108 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1430, PETRI_PLACES=117, PETRI_TRANSITIONS=151}
[2024-06-20 19:29:16,108 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 63 predicate places.
[2024-06-20 19:29:16,108 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 151 transitions, 1430 flow
[2024-06-20 19:29:16,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:16,109 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:16,109 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:16,109 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:29:16,109 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:16,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:16,109 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107851780, now seen corresponding path program 1 times
[2024-06-20 19:29:16,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:29:16,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753710385]
[2024-06-20 19:29:16,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:29:16,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:29:16,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:36,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:29:36,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:29:36,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753710385]
[2024-06-20 19:29:36,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753710385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:36,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:36,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:29:36,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191520074]
[2024-06-20 19:29:36,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:36,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:29:36,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:29:36,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:29:36,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:29:36,641 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:29:36,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 151 transitions, 1430 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:36,642 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:36,642 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:29:36,642 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:42,122 INFO  L124   PetriNetUnfolderBase]: 10516/14583 cut-off events.
[2024-06-20 19:29:42,122 INFO  L125   PetriNetUnfolderBase]: For 299231/299234 co-relation queries the response was YES.
[2024-06-20 19:29:42,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83358 conditions, 14583 events. 10516/14583 cut-off events. For 299231/299234 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 79513 event pairs, 4270 based on Foata normal form. 18/14593 useless extension candidates. Maximal degree in co-relation 83310. Up to 13655 conditions per place. 
[2024-06-20 19:29:42,219 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 147 selfloop transitions, 54 changer transitions 0/207 dead transitions.
[2024-06-20 19:29:42,219 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 207 transitions, 2067 flow
[2024-06-20 19:29:42,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:29:42,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:29:42,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions.
[2024-06-20 19:29:42,221 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4803921568627451
[2024-06-20 19:29:42,221 INFO  L175             Difference]: Start difference. First operand has 117 places, 151 transitions, 1430 flow. Second operand 8 states and 196 transitions.
[2024-06-20 19:29:42,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 207 transitions, 2067 flow
[2024-06-20 19:29:42,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 207 transitions, 1960 flow, removed 41 selfloop flow, removed 3 redundant places.
[2024-06-20 19:29:42,413 INFO  L231             Difference]: Finished difference. Result has 124 places, 160 transitions, 1593 flow
[2024-06-20 19:29:42,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1593, PETRI_PLACES=124, PETRI_TRANSITIONS=160}
[2024-06-20 19:29:42,414 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 70 predicate places.
[2024-06-20 19:29:42,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 160 transitions, 1593 flow
[2024-06-20 19:29:42,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:42,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:42,414 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:42,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:29:42,415 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:42,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:42,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -412950346, now seen corresponding path program 1 times
[2024-06-20 19:29:42,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:29:42,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485523255]
[2024-06-20 19:29:42,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:29:42,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:29:42,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:30:06,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:30:06,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:30:06,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485523255]
[2024-06-20 19:30:06,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485523255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:06,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:06,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:30:06,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663245489]
[2024-06-20 19:30:06,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:06,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:30:06,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:30:06,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:30:06,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:30:06,719 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:30:06,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 160 transitions, 1593 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:06,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:30:06,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:30:06,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:12,283 INFO  L124   PetriNetUnfolderBase]: 10548/14627 cut-off events.
[2024-06-20 19:30:12,284 INFO  L125   PetriNetUnfolderBase]: For 317603/317609 co-relation queries the response was YES.
[2024-06-20 19:30:12,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84730 conditions, 14627 events. 10548/14627 cut-off events. For 317603/317609 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 79664 event pairs, 4247 based on Foata normal form. 8/14630 useless extension candidates. Maximal degree in co-relation 84679. Up to 14319 conditions per place. 
[2024-06-20 19:30:12,662 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 168 selfloop transitions, 34 changer transitions 0/208 dead transitions.
[2024-06-20 19:30:12,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 208 transitions, 2315 flow
[2024-06-20 19:30:12,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:30:12,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:30:12,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions.
[2024-06-20 19:30:12,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4400871459694989
[2024-06-20 19:30:12,665 INFO  L175             Difference]: Start difference. First operand has 124 places, 160 transitions, 1593 flow. Second operand 9 states and 202 transitions.
[2024-06-20 19:30:12,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 208 transitions, 2315 flow
[2024-06-20 19:30:12,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 208 transitions, 2224 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-20 19:30:12,838 INFO  L231             Difference]: Finished difference. Result has 130 places, 168 transitions, 1719 flow
[2024-06-20 19:30:12,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1719, PETRI_PLACES=130, PETRI_TRANSITIONS=168}
[2024-06-20 19:30:12,838 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 76 predicate places.
[2024-06-20 19:30:12,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 168 transitions, 1719 flow
[2024-06-20 19:30:12,839 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:12,839 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:12,839 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:12,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:30:12,839 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:12,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:12,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1242923464, now seen corresponding path program 2 times
[2024-06-20 19:30:12,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:30:12,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243716055]
[2024-06-20 19:30:12,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:30:12,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:30:12,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:30:36,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:30:36,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:30:36,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243716055]
[2024-06-20 19:30:36,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243716055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:36,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:36,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:30:36,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851158102]
[2024-06-20 19:30:36,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:36,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:30:36,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:30:36,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:30:36,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:30:36,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:30:36,959 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 168 transitions, 1719 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:36,959 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:30:36,959 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:30:36,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:42,583 INFO  L124   PetriNetUnfolderBase]: 10631/14751 cut-off events.
[2024-06-20 19:30:42,583 INFO  L125   PetriNetUnfolderBase]: For 350789/350798 co-relation queries the response was YES.
[2024-06-20 19:30:42,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88151 conditions, 14751 events. 10631/14751 cut-off events. For 350789/350798 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 80457 event pairs, 4295 based on Foata normal form. 10/14753 useless extension candidates. Maximal degree in co-relation 88099. Up to 14238 conditions per place. 
[2024-06-20 19:30:42,695 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 144 selfloop transitions, 59 changer transitions 0/209 dead transitions.
[2024-06-20 19:30:42,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 209 transitions, 2513 flow
[2024-06-20 19:30:42,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:30:42,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:30:42,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions.
[2024-06-20 19:30:42,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4733893557422969
[2024-06-20 19:30:42,698 INFO  L175             Difference]: Start difference. First operand has 130 places, 168 transitions, 1719 flow. Second operand 7 states and 169 transitions.
[2024-06-20 19:30:42,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 209 transitions, 2513 flow
[2024-06-20 19:30:42,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 209 transitions, 2403 flow, removed 39 selfloop flow, removed 5 redundant places.
[2024-06-20 19:30:42,959 INFO  L231             Difference]: Finished difference. Result has 133 places, 178 transitions, 1891 flow
[2024-06-20 19:30:42,959 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1891, PETRI_PLACES=133, PETRI_TRANSITIONS=178}
[2024-06-20 19:30:42,959 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 79 predicate places.
[2024-06-20 19:30:42,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 178 transitions, 1891 flow
[2024-06-20 19:30:42,960 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:42,960 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:42,960 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:42,960 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:30:42,960 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:42,960 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:42,960 INFO  L85        PathProgramCache]: Analyzing trace with hash 411308096, now seen corresponding path program 2 times
[2024-06-20 19:30:42,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:30:42,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930308862]
[2024-06-20 19:30:42,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:30:42,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:30:42,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:31:03,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:31:03,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:31:03,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930308862]
[2024-06-20 19:31:03,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930308862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:31:03,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:31:03,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:31:03,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913209157]
[2024-06-20 19:31:03,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:31:03,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:31:03,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:31:03,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:31:03,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:31:03,676 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:31:03,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 178 transitions, 1891 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:31:03,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:31:03,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:31:03,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:31:09,349 INFO  L124   PetriNetUnfolderBase]: 10592/14689 cut-off events.
[2024-06-20 19:31:09,349 INFO  L125   PetriNetUnfolderBase]: For 373823/373826 co-relation queries the response was YES.
[2024-06-20 19:31:09,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88693 conditions, 14689 events. 10592/14689 cut-off events. For 373823/373826 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 79902 event pairs, 3069 based on Foata normal form. 18/14699 useless extension candidates. Maximal degree in co-relation 88638. Up to 13069 conditions per place. 
[2024-06-20 19:31:09,446 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 151 selfloop transitions, 62 changer transitions 0/219 dead transitions.
[2024-06-20 19:31:09,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 219 transitions, 2437 flow
[2024-06-20 19:31:09,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:31:09,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:31:09,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions.
[2024-06-20 19:31:09,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49019607843137253
[2024-06-20 19:31:09,460 INFO  L175             Difference]: Start difference. First operand has 133 places, 178 transitions, 1891 flow. Second operand 7 states and 175 transitions.
[2024-06-20 19:31:09,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 219 transitions, 2437 flow
[2024-06-20 19:31:09,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 219 transitions, 2308 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-20 19:31:09,769 INFO  L231             Difference]: Finished difference. Result has 137 places, 178 transitions, 1899 flow
[2024-06-20 19:31:09,770 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1899, PETRI_PLACES=137, PETRI_TRANSITIONS=178}
[2024-06-20 19:31:09,770 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 83 predicate places.
[2024-06-20 19:31:09,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 178 transitions, 1899 flow
[2024-06-20 19:31:09,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:31:09,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:31:09,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:31:09,771 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:31:09,771 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:31:09,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:31:09,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 677005376, now seen corresponding path program 3 times
[2024-06-20 19:31:09,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:31:09,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903883083]
[2024-06-20 19:31:09,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:31:09,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:31:09,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:31:30,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:31:30,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:31:30,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903883083]
[2024-06-20 19:31:30,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903883083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:31:30,719 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:31:30,719 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:31:30,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944370328]
[2024-06-20 19:31:30,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:31:30,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:31:30,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:31:30,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:31:30,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:31:30,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:31:30,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 178 transitions, 1899 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:31:30,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:31:30,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:31:30,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:31:36,016 INFO  L124   PetriNetUnfolderBase]: 10553/14625 cut-off events.
[2024-06-20 19:31:36,016 INFO  L125   PetriNetUnfolderBase]: For 394707/394716 co-relation queries the response was YES.
[2024-06-20 19:31:36,068 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89214 conditions, 14625 events. 10553/14625 cut-off events. For 394707/394716 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79466 event pairs, 2560 based on Foata normal form. 19/14619 useless extension candidates. Maximal degree in co-relation 89158. Up to 12830 conditions per place. 
[2024-06-20 19:31:36,136 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 147 selfloop transitions, 63 changer transitions 0/216 dead transitions.
[2024-06-20 19:31:36,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 216 transitions, 2439 flow
[2024-06-20 19:31:36,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:31:36,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:31:36,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-06-20 19:31:36,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47058823529411764
[2024-06-20 19:31:36,140 INFO  L175             Difference]: Start difference. First operand has 137 places, 178 transitions, 1899 flow. Second operand 7 states and 168 transitions.
[2024-06-20 19:31:36,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 216 transitions, 2439 flow
[2024-06-20 19:31:36,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 216 transitions, 2275 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-20 19:31:36,433 INFO  L231             Difference]: Finished difference. Result has 137 places, 179 transitions, 1884 flow
[2024-06-20 19:31:36,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1884, PETRI_PLACES=137, PETRI_TRANSITIONS=179}
[2024-06-20 19:31:36,433 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 83 predicate places.
[2024-06-20 19:31:36,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 179 transitions, 1884 flow
[2024-06-20 19:31:36,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:31:36,434 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:31:36,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:31:36,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:31:36,434 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:31:36,435 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:31:36,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -58271596, now seen corresponding path program 2 times
[2024-06-20 19:31:36,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:31:36,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845053094]
[2024-06-20 19:31:36,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:31:36,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:31:36,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:31:58,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:31:58,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:31:58,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845053094]
[2024-06-20 19:31:58,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845053094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:31:58,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:31:58,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:31:58,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034991319]
[2024-06-20 19:31:58,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:31:58,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:31:58,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:31:58,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:31:58,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:31:59,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:31:59,251 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 179 transitions, 1884 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:31:59,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:31:59,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:31:59,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:32:04,611 INFO  L124   PetriNetUnfolderBase]: 10585/14677 cut-off events.
[2024-06-20 19:32:04,611 INFO  L125   PetriNetUnfolderBase]: For 393026/393038 co-relation queries the response was YES.
[2024-06-20 19:32:04,652 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90055 conditions, 14677 events. 10585/14677 cut-off events. For 393026/393038 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79880 event pairs, 4214 based on Foata normal form. 12/14683 useless extension candidates. Maximal degree in co-relation 89998. Up to 14343 conditions per place. 
[2024-06-20 19:32:04,716 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 167 selfloop transitions, 36 changer transitions 0/209 dead transitions.
[2024-06-20 19:32:04,716 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 209 transitions, 2506 flow
[2024-06-20 19:32:04,719 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:32:04,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:32:04,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions.
[2024-06-20 19:32:04,720 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43977591036414565
[2024-06-20 19:32:04,720 INFO  L175             Difference]: Start difference. First operand has 137 places, 179 transitions, 1884 flow. Second operand 7 states and 157 transitions.
[2024-06-20 19:32:04,720 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 209 transitions, 2506 flow
[2024-06-20 19:32:04,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 209 transitions, 2349 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-20 19:32:04,958 INFO  L231             Difference]: Finished difference. Result has 139 places, 183 transitions, 1862 flow
[2024-06-20 19:32:04,959 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1862, PETRI_PLACES=139, PETRI_TRANSITIONS=183}
[2024-06-20 19:32:04,960 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places.
[2024-06-20 19:32:04,960 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 183 transitions, 1862 flow
[2024-06-20 19:32:04,960 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:32:04,960 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:32:04,960 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:32:04,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:32:04,961 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:32:04,961 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:32:04,961 INFO  L85        PathProgramCache]: Analyzing trace with hash -58687306, now seen corresponding path program 3 times
[2024-06-20 19:32:04,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:32:04,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5933695]
[2024-06-20 19:32:04,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:32:04,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:32:05,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:32:27,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:32:27,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:32:27,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5933695]
[2024-06-20 19:32:27,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5933695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:32:27,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:32:27,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:32:27,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326889777]
[2024-06-20 19:32:27,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:32:27,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:32:27,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:32:27,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:32:27,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:32:27,350 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:32:27,351 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 183 transitions, 1862 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:32:27,351 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:32:27,351 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:32:27,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:32:32,836 INFO  L124   PetriNetUnfolderBase]: 10571/14659 cut-off events.
[2024-06-20 19:32:32,836 INFO  L125   PetriNetUnfolderBase]: For 412436/412448 co-relation queries the response was YES.
[2024-06-20 19:32:32,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90032 conditions, 14659 events. 10571/14659 cut-off events. For 412436/412448 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79735 event pairs, 4212 based on Foata normal form. 12/14665 useless extension candidates. Maximal degree in co-relation 89974. Up to 14331 conditions per place. 
[2024-06-20 19:32:32,957 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 173 selfloop transitions, 37 changer transitions 0/216 dead transitions.
[2024-06-20 19:32:32,957 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 216 transitions, 2366 flow
[2024-06-20 19:32:32,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:32:32,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:32:32,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-20 19:32:32,961 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226579520697168
[2024-06-20 19:32:32,961 INFO  L175             Difference]: Start difference. First operand has 139 places, 183 transitions, 1862 flow. Second operand 9 states and 194 transitions.
[2024-06-20 19:32:32,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 216 transitions, 2366 flow
[2024-06-20 19:32:33,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 216 transitions, 2238 flow, removed 38 selfloop flow, removed 4 redundant places.
[2024-06-20 19:32:33,263 INFO  L231             Difference]: Finished difference. Result has 144 places, 183 transitions, 1817 flow
[2024-06-20 19:32:33,263 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1817, PETRI_PLACES=144, PETRI_TRANSITIONS=183}
[2024-06-20 19:32:33,264 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 90 predicate places.
[2024-06-20 19:32:33,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 183 transitions, 1817 flow
[2024-06-20 19:32:33,264 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:32:33,264 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:32:33,264 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:32:33,264 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:32:33,265 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:32:33,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:32:33,265 INFO  L85        PathProgramCache]: Analyzing trace with hash -58687678, now seen corresponding path program 3 times
[2024-06-20 19:32:33,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:32:33,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161222307]
[2024-06-20 19:32:33,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:32:33,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:32:33,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:32:56,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:32:56,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:32:56,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161222307]
[2024-06-20 19:32:56,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161222307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:32:56,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:32:56,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:32:56,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464541136]
[2024-06-20 19:32:56,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:32:56,311 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:32:56,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:32:56,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:32:56,312 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:32:56,465 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51
[2024-06-20 19:32:56,466 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 183 transitions, 1817 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:32:56,466 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:32:56,466 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51
[2024-06-20 19:32:56,466 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:33:01,984 INFO  L124   PetriNetUnfolderBase]: 10562/14649 cut-off events.
[2024-06-20 19:33:01,984 INFO  L125   PetriNetUnfolderBase]: For 436043/436058 co-relation queries the response was YES.
[2024-06-20 19:33:02,041 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90632 conditions, 14649 events. 10562/14649 cut-off events. For 436043/436058 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79793 event pairs, 4281 based on Foata normal form. 14/14647 useless extension candidates. Maximal degree in co-relation 90573. Up to 14143 conditions per place. 
[2024-06-20 19:33:02,115 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 145 selfloop transitions, 58 changer transitions 0/209 dead transitions.
[2024-06-20 19:33:02,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 209 transitions, 2497 flow
[2024-06-20 19:33:02,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:33:02,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:33:02,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-20 19:33:02,118 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4565826330532213
[2024-06-20 19:33:02,119 INFO  L175             Difference]: Start difference. First operand has 144 places, 183 transitions, 1817 flow. Second operand 7 states and 163 transitions.
[2024-06-20 19:33:02,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 209 transitions, 2497 flow
[2024-06-20 19:33:02,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 209 transitions, 2377 flow, removed 13 selfloop flow, removed 9 redundant places.
[2024-06-20 19:33:02,432 INFO  L231             Difference]: Finished difference. Result has 142 places, 183 transitions, 1824 flow
[2024-06-20 19:33:02,432 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1824, PETRI_PLACES=142, PETRI_TRANSITIONS=183}
[2024-06-20 19:33:02,437 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 88 predicate places.
[2024-06-20 19:33:02,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 1824 flow
[2024-06-20 19:33:02,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:33:02,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:33:02,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:33:02,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:33:02,439 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:33:02,439 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:33:02,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -977590270, now seen corresponding path program 1 times
[2024-06-20 19:33:02,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:33:02,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668973550]
[2024-06-20 19:33:02,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:33:02,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:33:02,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:33:24,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:33:24,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:33:24,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668973550]
[2024-06-20 19:33:24,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668973550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:33:24,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:33:24,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:33:24,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075932300]
[2024-06-20 19:33:24,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:33:24,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:33:24,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:33:24,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:33:24,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:33:24,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:33:24,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 1824 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:33:24,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:33:24,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:33:24,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:33:29,508 INFO  L124   PetriNetUnfolderBase]: 9237/13119 cut-off events.
[2024-06-20 19:33:29,509 INFO  L125   PetriNetUnfolderBase]: For 388228/388230 co-relation queries the response was YES.
[2024-06-20 19:33:29,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81072 conditions, 13119 events. 9237/13119 cut-off events. For 388228/388230 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73432 event pairs, 3514 based on Foata normal form. 4/13113 useless extension candidates. Maximal degree in co-relation 81012. Up to 12633 conditions per place. 
[2024-06-20 19:33:29,605 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 189 selfloop transitions, 33 changer transitions 0/229 dead transitions.
[2024-06-20 19:33:29,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 229 transitions, 2544 flow
[2024-06-20 19:33:29,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:33:29,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:33:29,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions.
[2024-06-20 19:33:29,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42701525054466233
[2024-06-20 19:33:29,609 INFO  L175             Difference]: Start difference. First operand has 142 places, 183 transitions, 1824 flow. Second operand 9 states and 196 transitions.
[2024-06-20 19:33:29,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 229 transitions, 2544 flow
[2024-06-20 19:33:29,881 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 229 transitions, 2375 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-20 19:33:29,884 INFO  L231             Difference]: Finished difference. Result has 147 places, 201 transitions, 1964 flow
[2024-06-20 19:33:29,884 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1964, PETRI_PLACES=147, PETRI_TRANSITIONS=201}
[2024-06-20 19:33:29,886 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 93 predicate places.
[2024-06-20 19:33:29,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 201 transitions, 1964 flow
[2024-06-20 19:33:29,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:33:29,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:33:29,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:33:29,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:33:29,887 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:33:29,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:33:29,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -235754470, now seen corresponding path program 2 times
[2024-06-20 19:33:29,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:33:29,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023825632]
[2024-06-20 19:33:29,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:33:29,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:33:29,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:33:53,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:33:53,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:33:53,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023825632]
[2024-06-20 19:33:53,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023825632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:33:53,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:33:53,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:33:53,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355824182]
[2024-06-20 19:33:53,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:33:53,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:33:53,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:33:53,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:33:53,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:33:53,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:33:53,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 201 transitions, 1964 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:33:53,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:33:53,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:33:53,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:33:58,894 INFO  L124   PetriNetUnfolderBase]: 9253/13144 cut-off events.
[2024-06-20 19:33:58,894 INFO  L125   PetriNetUnfolderBase]: For 416120/416124 co-relation queries the response was YES.
[2024-06-20 19:33:58,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83731 conditions, 13144 events. 9253/13144 cut-off events. For 416120/416124 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73634 event pairs, 3499 based on Foata normal form. 6/13140 useless extension candidates. Maximal degree in co-relation 83670. Up to 12640 conditions per place. 
[2024-06-20 19:33:59,001 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 190 selfloop transitions, 35 changer transitions 0/232 dead transitions.
[2024-06-20 19:33:59,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 232 transitions, 2568 flow
[2024-06-20 19:33:59,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:33:59,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:33:59,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions.
[2024-06-20 19:33:59,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.453781512605042
[2024-06-20 19:33:59,005 INFO  L175             Difference]: Start difference. First operand has 147 places, 201 transitions, 1964 flow. Second operand 7 states and 162 transitions.
[2024-06-20 19:33:59,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 232 transitions, 2568 flow
[2024-06-20 19:33:59,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 232 transitions, 2461 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-20 19:33:59,358 INFO  L231             Difference]: Finished difference. Result has 148 places, 205 transitions, 2016 flow
[2024-06-20 19:33:59,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2016, PETRI_PLACES=148, PETRI_TRANSITIONS=205}
[2024-06-20 19:33:59,359 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 94 predicate places.
[2024-06-20 19:33:59,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 205 transitions, 2016 flow
[2024-06-20 19:33:59,359 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:33:59,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:33:59,359 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:33:59,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:33:59,360 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:33:59,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:33:59,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -235634500, now seen corresponding path program 3 times
[2024-06-20 19:33:59,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:33:59,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378063946]
[2024-06-20 19:33:59,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:33:59,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:33:59,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:34:22,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:34:22,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:34:22,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378063946]
[2024-06-20 19:34:22,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378063946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:34:22,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:34:22,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:34:22,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768448949]
[2024-06-20 19:34:22,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:34:22,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:34:22,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:34:22,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:34:22,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:34:22,880 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:34:22,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 205 transitions, 2016 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:34:22,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:34:22,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:34:22,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:34:27,918 INFO  L124   PetriNetUnfolderBase]: 9269/13193 cut-off events.
[2024-06-20 19:34:27,919 INFO  L125   PetriNetUnfolderBase]: For 452326/452331 co-relation queries the response was YES.
[2024-06-20 19:34:27,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86652 conditions, 13193 events. 9269/13193 cut-off events. For 452326/452331 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 74364 event pairs, 3507 based on Foata normal form. 4/13192 useless extension candidates. Maximal degree in co-relation 86591. Up to 12609 conditions per place. 
[2024-06-20 19:34:28,045 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 180 selfloop transitions, 51 changer transitions 0/238 dead transitions.
[2024-06-20 19:34:28,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 238 transitions, 2816 flow
[2024-06-20 19:34:28,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:34:28,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:34:28,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions.
[2024-06-20 19:34:28,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46218487394957986
[2024-06-20 19:34:28,049 INFO  L175             Difference]: Start difference. First operand has 148 places, 205 transitions, 2016 flow. Second operand 7 states and 165 transitions.
[2024-06-20 19:34:28,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 238 transitions, 2816 flow
[2024-06-20 19:34:28,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 238 transitions, 2675 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-20 19:34:28,453 INFO  L231             Difference]: Finished difference. Result has 150 places, 213 transitions, 2146 flow
[2024-06-20 19:34:28,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2146, PETRI_PLACES=150, PETRI_TRANSITIONS=213}
[2024-06-20 19:34:28,454 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 96 predicate places.
[2024-06-20 19:34:28,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 213 transitions, 2146 flow
[2024-06-20 19:34:28,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:34:28,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:34:28,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:34:28,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:34:28,455 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:34:28,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:34:28,455 INFO  L85        PathProgramCache]: Analyzing trace with hash -235634314, now seen corresponding path program 1 times
[2024-06-20 19:34:28,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:34:28,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114173491]
[2024-06-20 19:34:28,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:34:28,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:34:28,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:34:47,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:34:47,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:34:47,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114173491]
[2024-06-20 19:34:47,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114173491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:34:47,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:34:47,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:34:47,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090124628]
[2024-06-20 19:34:47,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:34:47,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:34:47,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:34:47,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:34:47,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:34:47,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:34:47,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 213 transitions, 2146 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:34:47,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:34:47,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:34:47,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:34:53,099 INFO  L124   PetriNetUnfolderBase]: 9301/13225 cut-off events.
[2024-06-20 19:34:53,099 INFO  L125   PetriNetUnfolderBase]: For 459186/459189 co-relation queries the response was YES.
[2024-06-20 19:34:53,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86893 conditions, 13225 events. 9301/13225 cut-off events. For 459186/459189 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 74506 event pairs, 3475 based on Foata normal form. 6/13224 useless extension candidates. Maximal degree in co-relation 86831. Up to 12655 conditions per place. 
[2024-06-20 19:34:53,201 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 214 selfloop transitions, 38 changer transitions 0/259 dead transitions.
[2024-06-20 19:34:53,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 259 transitions, 3014 flow
[2024-06-20 19:34:53,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:34:53,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:34:53,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions.
[2024-06-20 19:34:53,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44880174291938996
[2024-06-20 19:34:53,204 INFO  L175             Difference]: Start difference. First operand has 150 places, 213 transitions, 2146 flow. Second operand 9 states and 206 transitions.
[2024-06-20 19:34:53,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 259 transitions, 3014 flow
[2024-06-20 19:34:53,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 259 transitions, 2916 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-20 19:34:53,530 INFO  L231             Difference]: Finished difference. Result has 156 places, 221 transitions, 2273 flow
[2024-06-20 19:34:53,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2273, PETRI_PLACES=156, PETRI_TRANSITIONS=221}
[2024-06-20 19:34:53,531 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 102 predicate places.
[2024-06-20 19:34:53,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 221 transitions, 2273 flow
[2024-06-20 19:34:53,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:34:53,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:34:53,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:34:53,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:34:53,531 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:34:53,532 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:34:53,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -1921678606, now seen corresponding path program 2 times
[2024-06-20 19:34:53,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:34:53,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090771493]
[2024-06-20 19:34:53,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:34:53,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:34:53,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:35:15,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:35:15,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:35:15,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090771493]
[2024-06-20 19:35:15,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090771493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:35:15,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:35:15,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:35:15,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832647097]
[2024-06-20 19:35:15,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:35:15,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:35:15,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:35:15,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:35:15,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:35:16,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:35:16,039 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 221 transitions, 2273 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:35:16,040 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:35:16,040 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:35:16,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:35:21,048 INFO  L124   PetriNetUnfolderBase]: 9333/13278 cut-off events.
[2024-06-20 19:35:21,049 INFO  L125   PetriNetUnfolderBase]: For 489473/489485 co-relation queries the response was YES.
[2024-06-20 19:35:21,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89455 conditions, 13278 events. 9333/13278 cut-off events. For 489473/489485 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 74888 event pairs, 3459 based on Foata normal form. 12/13282 useless extension candidates. Maximal degree in co-relation 89391. Up to 12684 conditions per place. 
[2024-06-20 19:35:21,157 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 204 selfloop transitions, 41 changer transitions 0/252 dead transitions.
[2024-06-20 19:35:21,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 252 transitions, 3039 flow
[2024-06-20 19:35:21,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:35:21,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:35:21,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-20 19:35:21,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4565826330532213
[2024-06-20 19:35:21,159 INFO  L175             Difference]: Start difference. First operand has 156 places, 221 transitions, 2273 flow. Second operand 7 states and 163 transitions.
[2024-06-20 19:35:21,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 252 transitions, 3039 flow
[2024-06-20 19:35:21,540 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 252 transitions, 2895 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-20 19:35:21,543 INFO  L231             Difference]: Finished difference. Result has 158 places, 225 transitions, 2292 flow
[2024-06-20 19:35:21,543 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2292, PETRI_PLACES=158, PETRI_TRANSITIONS=225}
[2024-06-20 19:35:21,544 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 104 predicate places.
[2024-06-20 19:35:21,544 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 225 transitions, 2292 flow
[2024-06-20 19:35:21,544 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:35:21,544 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:35:21,544 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:35:21,544 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:35:21,544 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:35:21,545 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:35:21,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -230992870, now seen corresponding path program 4 times
[2024-06-20 19:35:21,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:35:21,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133904554]
[2024-06-20 19:35:21,545 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:35:21,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:35:21,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:35:45,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:35:45,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:35:45,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133904554]
[2024-06-20 19:35:45,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133904554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:35:45,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:35:45,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:35:45,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927386055]
[2024-06-20 19:35:45,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:35:45,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:35:45,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:35:45,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:35:45,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:35:45,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:35:45,614 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 225 transitions, 2292 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:35:45,614 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:35:45,614 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:35:45,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:35:50,713 INFO  L124   PetriNetUnfolderBase]: 9326/13266 cut-off events.
[2024-06-20 19:35:50,714 INFO  L125   PetriNetUnfolderBase]: For 512230/512235 co-relation queries the response was YES.
[2024-06-20 19:35:50,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90025 conditions, 13266 events. 9326/13266 cut-off events. For 512230/512235 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 74778 event pairs, 3502 based on Foata normal form. 2/13255 useless extension candidates. Maximal degree in co-relation 89959. Up to 12686 conditions per place. 
[2024-06-20 19:35:50,830 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 188 selfloop transitions, 51 changer transitions 0/246 dead transitions.
[2024-06-20 19:35:50,831 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 246 transitions, 2834 flow
[2024-06-20 19:35:50,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:35:50,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:35:50,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions.
[2024-06-20 19:35:50,834 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4481792717086835
[2024-06-20 19:35:50,834 INFO  L175             Difference]: Start difference. First operand has 158 places, 225 transitions, 2292 flow. Second operand 7 states and 160 transitions.
[2024-06-20 19:35:50,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 246 transitions, 2834 flow
[2024-06-20 19:35:51,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 246 transitions, 2708 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-06-20 19:35:51,364 INFO  L231             Difference]: Finished difference. Result has 161 places, 225 transitions, 2277 flow
[2024-06-20 19:35:51,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2277, PETRI_PLACES=161, PETRI_TRANSITIONS=225}
[2024-06-20 19:35:51,365 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 107 predicate places.
[2024-06-20 19:35:51,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 225 transitions, 2277 flow
[2024-06-20 19:35:51,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:35:51,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:35:51,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:35:51,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:35:51,366 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:35:51,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:35:51,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 793830630, now seen corresponding path program 3 times
[2024-06-20 19:35:51,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:35:51,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041779853]
[2024-06-20 19:35:51,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:35:51,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:35:51,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:36:10,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:36:10,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:36:10,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041779853]
[2024-06-20 19:36:10,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041779853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:36:10,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:36:10,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:36:10,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938551859]
[2024-06-20 19:36:10,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:36:10,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:36:10,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:36:10,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:36:10,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:36:11,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:36:11,126 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 225 transitions, 2277 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:36:11,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:36:11,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:36:11,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:36:16,217 INFO  L124   PetriNetUnfolderBase]: 9312/13251 cut-off events.
[2024-06-20 19:36:16,217 INFO  L125   PetriNetUnfolderBase]: For 536518/536530 co-relation queries the response was YES.
[2024-06-20 19:36:16,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90529 conditions, 13251 events. 9312/13251 cut-off events. For 536518/536530 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 74723 event pairs, 3457 based on Foata normal form. 12/13255 useless extension candidates. Maximal degree in co-relation 90462. Up to 12663 conditions per place. 
[2024-06-20 19:36:16,321 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 210 selfloop transitions, 42 changer transitions 0/259 dead transitions.
[2024-06-20 19:36:16,321 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 259 transitions, 2887 flow
[2024-06-20 19:36:16,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:36:16,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:36:16,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions.
[2024-06-20 19:36:16,325 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4400871459694989
[2024-06-20 19:36:16,325 INFO  L175             Difference]: Start difference. First operand has 161 places, 225 transitions, 2277 flow. Second operand 9 states and 202 transitions.
[2024-06-20 19:36:16,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 259 transitions, 2887 flow
[2024-06-20 19:36:16,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 259 transitions, 2692 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-20 19:36:16,736 INFO  L231             Difference]: Finished difference. Result has 163 places, 225 transitions, 2175 flow
[2024-06-20 19:36:16,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2175, PETRI_PLACES=163, PETRI_TRANSITIONS=225}
[2024-06-20 19:36:16,736 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 109 predicate places.
[2024-06-20 19:36:16,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 225 transitions, 2175 flow
[2024-06-20 19:36:16,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:36:16,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:36:16,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:36:16,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:36:16,737 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:36:16,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:36:16,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 794076708, now seen corresponding path program 1 times
[2024-06-20 19:36:16,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:36:16,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40730272]
[2024-06-20 19:36:16,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:36:16,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:36:16,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15