./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.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_tso.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
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_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix055_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 22:09:25,363 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:09:25,417 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:09:25,426 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:09:25,426 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:09:25,454 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:09:25,454 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:09:25,455 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:09:25,455 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:09:25,458 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:09:25,458 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:09:25,459 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:09:25,459 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:09:25,460 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:09:25,460 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:09:25,461 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:09:25,461 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:09:25,461 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:09:25,461 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:09:25,461 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:09:25,462 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:09:25,463 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:09:25,463 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:09:25,463 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:09:25,463 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:09:25,463 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:09:25,464 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:09:25,464 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:09:25,464 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:09:25,464 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:09:25,465 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:09:25,465 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:09:25,466 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:09:25,466 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:09:25,467 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:09:25,467 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:09:25,467 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:09:25,467 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:09:25,467 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-03 22:09:25,687 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:09:25,712 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:09:25,714 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:09:25,715 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:09:25,715 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:09:25,716 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i
[2024-06-03 22:09:26,685 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:09:26,892 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:09:26,893 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i
[2024-06-03 22:09:26,912 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1f7d0a3/9f227e8baa0845a09b8e30299cf6ce94/FLAG21d5ce4aa
[2024-06-03 22:09:26,922 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1f7d0a3/9f227e8baa0845a09b8e30299cf6ce94
[2024-06-03 22:09:26,923 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:09:26,924 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:09:26,924 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_tso.oepc.yml/witness.yml
[2024-06-03 22:09:27,117 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:09:27,118 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:09:27,119 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:09:27,119 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:09:27,123 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:09:27,125 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:09:26" (1/2) ...
[2024-06-03 22:09:27,126 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93ded5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:09:27, skipping insertion in model container
[2024-06-03 22:09:27,126 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:09:26" (1/2) ...
[2024-06-03 22:09:27,128 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e87c7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:09:27, skipping insertion in model container
[2024-06-03 22:09:27,128 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:09:27" (2/2) ...
[2024-06-03 22:09:27,128 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93ded5e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:27, skipping insertion in model container
[2024-06-03 22:09:27,129 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:09:27" (2/2) ...
[2024-06-03 22:09:27,129 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:09:27,224 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:09:27,225 INFO  L97    edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff0_thd4 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd4 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )y >= 0LL) && (long long )x$r_buff0_thd4 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )y >= 0LL) && (long long )x$r_buff1_thd4 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff0_thd4 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd4 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))
[2024-06-03 22:09:27,226 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff0_thd4 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd4 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )y >= 0LL) && (long long )x$r_buff0_thd4 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )y >= 0LL) && (long long )x$r_buff1_thd4 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff0_thd4 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd4 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))
[2024-06-03 22:09:27,226 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff0_thd4 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd4 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )y >= 0LL) && (long long )x$r_buff0_thd4 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )y >= 0LL) && (long long )x$r_buff1_thd4 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff0_thd4 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd4 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))
[2024-06-03 22:09:27,227 INFO  L97    edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || x$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff0_thd4 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd4 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd4 + (long long )y >= 0LL) && (long long )x$r_buff0_thd4 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd4 + (long long )y >= 0LL) && (long long )x$r_buff1_thd4 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff0_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$r_buff1_thd4 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff0_thd4 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd4 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff0_thd4 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))
[2024-06-03 22:09:27,228 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:09:27,229 INFO  L106   edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1;
[2024-06-03 22:09:27,266 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:09:27,534 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:09:27,548 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-03 22:09:27,956 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:09:28,001 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:09:28,002 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28 WrapperNode
[2024-06-03 22:09:28,002 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:09:28,002 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:09:28,003 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:09:28,003 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:09:28,007 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,055 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,274 INFO  L138                Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156
[2024-06-03 22:09:28,274 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:09:28,275 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:09:28,275 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:09:28,275 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:09:28,284 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,284 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,335 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,403 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-03 22:09:28,404 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,404 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,459 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,461 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,475 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,481 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,515 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:09:28,516 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:09:28,516 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:09:28,516 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:09:28,517 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (1/1) ...
[2024-06-03 22:09:28,521 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:09:28,564 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:09:28,610 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-03 22:09:28,645 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-03 22:09:28,680 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:09:28,680 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:09:28,681 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:09:28,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:09:28,681 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:09:28,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:09:28,682 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:09:28,682 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:09:28,682 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-03 22:09:28,683 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-03 22:09:28,683 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:09:28,684 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:09:28,684 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:09:28,684 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:09:28,685 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 22:09:28,844 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:09:28,846 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:09:30,763 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:09:30,763 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:09:31,192 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:09:31,193 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:09:31,193 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:09:31 BoogieIcfgContainer
[2024-06-03 22:09:31,193 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:09:31,195 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:09:31,195 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:09:31,198 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:09:31,198 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:09:26" (1/4) ...
[2024-06-03 22:09:31,198 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e774f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:09:31, skipping insertion in model container
[2024-06-03 22:09:31,198 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:09:27" (2/4) ...
[2024-06-03 22:09:31,199 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e774f13 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:09:31, skipping insertion in model container
[2024-06-03 22:09:31,199 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:09:28" (3/4) ...
[2024-06-03 22:09:31,199 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e774f13 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:09:31, skipping insertion in model container
[2024-06-03 22:09:31,199 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:09:31" (4/4) ...
[2024-06-03 22:09:31,200 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i
[2024-06-03 22:09:31,214 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:09:31,214 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-03 22:09:31,214 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:09:31,378 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:09:31,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 120 flow
[2024-06-03 22:09:31,475 INFO  L124   PetriNetUnfolderBase]: 0/48 cut-off events.
[2024-06-03 22:09:31,475 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:09:31,478 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 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/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 22:09:31,478 INFO  L82        GeneralOperation]: Start removeDead. Operand has 65 places, 52 transitions, 120 flow
[2024-06-03 22:09:31,482 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow
[2024-06-03 22:09:31,493 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:09:31,499 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;@2e35fea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:09:31,500 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-03 22:09:31,508 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:09:31,508 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-03 22:09:31,508 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:09:31,509 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:09:31,509 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:09:31,510 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-03 22:09:31,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:09:31,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -779787810, now seen corresponding path program 1 times
[2024-06-03 22:09:31,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:09:31,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106446909]
[2024-06-03 22:09:31,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:09:31,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:09:31,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:09:39,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:09:39,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:09:39,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106446909]
[2024-06-03 22:09:39,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106446909] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:09:39,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:09:39,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:09:39,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179532061]
[2024-06-03 22:09:39,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:09:39,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:09:39,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:09:39,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:09:39,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:09:39,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52
[2024-06-03 22:09:39,432 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:39,432 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:09:39,432 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52
[2024-06-03 22:09:39,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:09:44,579 INFO  L124   PetriNetUnfolderBase]: 9903/13810 cut-off events.
[2024-06-03 22:09:44,579 INFO  L125   PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES.
[2024-06-03 22:09:44,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27716 conditions, 13810 events. 9903/13810 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 75140 event pairs, 7667 based on Foata normal form. 1/13588 useless extension candidates. Maximal degree in co-relation 27700. Up to 13453 conditions per place. 
[2024-06-03 22:09:44,647 INFO  L140   encePairwiseOnDemand]: 43/52 looper letters, 45 selfloop transitions, 5 changer transitions 0/56 dead transitions.
[2024-06-03 22:09:44,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 233 flow
[2024-06-03 22:09:44,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:09:44,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:09:44,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions.
[2024-06-03 22:09:44,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5769230769230769
[2024-06-03 22:09:44,659 INFO  L175             Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 90 transitions.
[2024-06-03 22:09:44,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 233 flow
[2024-06-03 22:09:44,661 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-03 22:09:44,665 INFO  L231             Difference]: Finished difference. Result has 54 places, 46 transitions, 131 flow
[2024-06-03 22:09:44,666 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=46}
[2024-06-03 22:09:44,669 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places.
[2024-06-03 22:09:44,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 131 flow
[2024-06-03 22:09:44,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:44,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:09:44,669 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:09:44,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:09:44,670 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-03 22:09:44,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:09:44,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051753155, now seen corresponding path program 1 times
[2024-06-03 22:09:44,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:09:44,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761527361]
[2024-06-03 22:09:44,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:09:44,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:09:44,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:09:50,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-03 22:09:50,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:09:50,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761527361]
[2024-06-03 22:09:50,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761527361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:09:50,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:09:50,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:09:50,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545846232]
[2024-06-03 22:09:50,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:09:50,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:09:50,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:09:50,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:09:50,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:09:50,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52
[2024-06-03 22:09:50,891 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 131 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:50,891 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:09:50,891 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52
[2024-06-03 22:09:50,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:09:56,489 INFO  L124   PetriNetUnfolderBase]: 11585/15736 cut-off events.
[2024-06-03 22:09:56,489 INFO  L125   PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES.
[2024-06-03 22:09:56,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35857 conditions, 15736 events. 11585/15736 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81885 event pairs, 8249 based on Foata normal form. 4/15738 useless extension candidates. Maximal degree in co-relation 35842. Up to 15650 conditions per place. 
[2024-06-03 22:09:56,555 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 56 selfloop transitions, 9 changer transitions 0/70 dead transitions.
[2024-06-03 22:09:56,555 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 327 flow
[2024-06-03 22:09:56,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:09:56,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:09:56,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions.
[2024-06-03 22:09:56,557 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5432692307692307
[2024-06-03 22:09:56,557 INFO  L175             Difference]: Start difference. First operand has 54 places, 46 transitions, 131 flow. Second operand 4 states and 113 transitions.
[2024-06-03 22:09:56,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 327 flow
[2024-06-03 22:09:56,558 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:09:56,559 INFO  L231             Difference]: Finished difference. Result has 57 places, 50 transitions, 179 flow
[2024-06-03 22:09:56,559 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=50}
[2024-06-03 22:09:56,560 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places.
[2024-06-03 22:09:56,560 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 179 flow
[2024-06-03 22:09:56,560 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:56,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:09:56,560 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:09:56,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:09:56,561 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-03 22:09:56,561 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:09:56,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 820162407, now seen corresponding path program 1 times
[2024-06-03 22:09:56,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:09:56,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56584487]
[2024-06-03 22:09:56,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:09:56,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:09:56,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:10:01,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:10:01,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:10:01,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56584487]
[2024-06-03 22:10:01,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56584487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:10:01,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:10:01,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 22:10:01,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894145860]
[2024-06-03 22:10:01,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:10:02,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 22:10:02,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:10:02,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 22:10:02,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 22:10:02,163 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52
[2024-06-03 22:10:02,164 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 179 flow. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:10:02,164 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:10:02,164 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52
[2024-06-03 22:10:02,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:10:07,195 INFO  L124   PetriNetUnfolderBase]: 11565/15710 cut-off events.
[2024-06-03 22:10:07,195 INFO  L125   PetriNetUnfolderBase]: For 8281/8281 co-relation queries the response was YES.
[2024-06-03 22:10:07,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39748 conditions, 15710 events. 11565/15710 cut-off events. For 8281/8281 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81706 event pairs, 6611 based on Foata normal form. 8/15716 useless extension candidates. Maximal degree in co-relation 39731. Up to 15580 conditions per place. 
[2024-06-03 22:10:07,252 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 67 selfloop transitions, 13 changer transitions 0/85 dead transitions.
[2024-06-03 22:10:07,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 439 flow
[2024-06-03 22:10:07,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:10:07,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:10:07,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions.
[2024-06-03 22:10:07,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5346153846153846
[2024-06-03 22:10:07,255 INFO  L175             Difference]: Start difference. First operand has 57 places, 50 transitions, 179 flow. Second operand 5 states and 139 transitions.
[2024-06-03 22:10:07,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 439 flow
[2024-06-03 22:10:07,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 420 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-03 22:10:07,260 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 227 flow
[2024-06-03 22:10:07,260 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-03 22:10:07,261 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places.
[2024-06-03 22:10:07,261 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 227 flow
[2024-06-03 22:10:07,261 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:10:07,261 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:10:07,262 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:10:07,262 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:10:07,262 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-03 22:10:07,262 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:10:07,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -1239009080, now seen corresponding path program 1 times
[2024-06-03 22:10:07,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:10:07,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358952566]
[2024-06-03 22:10:07,263 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:10:07,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:10:07,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:10:14,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:10:14,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:10:14,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358952566]
[2024-06-03 22:10:14,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358952566] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:10:14,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:10:14,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:10:14,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778078313]
[2024-06-03 22:10:14,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:10:14,595 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:10:14,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:10:14,597 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:10:14,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:10:14,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52
[2024-06-03 22:10:14,820 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 227 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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-03 22:10:14,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:10:14,821 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52
[2024-06-03 22:10:14,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:10:20,081 INFO  L124   PetriNetUnfolderBase]: 11549/15684 cut-off events.
[2024-06-03 22:10:20,082 INFO  L125   PetriNetUnfolderBase]: For 16071/16071 co-relation queries the response was YES.
[2024-06-03 22:10:20,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43598 conditions, 15684 events. 11549/15684 cut-off events. For 16071/16071 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81730 event pairs, 5646 based on Foata normal form. 8/15690 useless extension candidates. Maximal degree in co-relation 43580. Up to 15514 conditions per place. 
[2024-06-03 22:10:20,145 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 74 selfloop transitions, 16 changer transitions 0/95 dead transitions.
[2024-06-03 22:10:20,145 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 523 flow
[2024-06-03 22:10:20,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:10:20,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:10:20,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions.
[2024-06-03 22:10:20,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5128205128205128
[2024-06-03 22:10:20,149 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 227 flow. Second operand 6 states and 160 transitions.
[2024-06-03 22:10:20,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 523 flow
[2024-06-03 22:10:20,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 490 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-03 22:10:20,153 INFO  L231             Difference]: Finished difference. Result has 62 places, 56 transitions, 258 flow
[2024-06-03 22:10:20,153 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=62, PETRI_TRANSITIONS=56}
[2024-06-03 22:10:20,154 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places.
[2024-06-03 22:10:20,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 258 flow
[2024-06-03 22:10:20,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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-03 22:10:20,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:10:20,154 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:10:20,154 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:10:20,154 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-03 22:10:20,155 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:10:20,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 1960933374, now seen corresponding path program 1 times
[2024-06-03 22:10:20,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:10:20,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365199585]
[2024-06-03 22:10:20,155 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:10:20,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:10:20,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:10:31,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:10:31,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:10:31,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365199585]
[2024-06-03 22:10:31,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365199585] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:10:31,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:10:31,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:10:31,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286549451]
[2024-06-03 22:10:31,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:10:31,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:10:31,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:10:31,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:10:31,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:10:31,567 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52
[2024-06-03 22:10:31,568 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 258 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:10:31,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:10:31,568 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52
[2024-06-03 22:10:31,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:10:36,121 INFO  L124   PetriNetUnfolderBase]: 9848/13724 cut-off events.
[2024-06-03 22:10:36,122 INFO  L125   PetriNetUnfolderBase]: For 21341/21341 co-relation queries the response was YES.
[2024-06-03 22:10:36,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40759 conditions, 13724 events. 9848/13724 cut-off events. For 21341/21341 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 74276 event pairs, 5737 based on Foata normal form. 3/13725 useless extension candidates. Maximal degree in co-relation 40740. Up to 13360 conditions per place. 
[2024-06-03 22:10:36,173 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 61 selfloop transitions, 10 changer transitions 0/77 dead transitions.
[2024-06-03 22:10:36,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 470 flow
[2024-06-03 22:10:36,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:10:36,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:10:36,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions.
[2024-06-03 22:10:36,175 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45384615384615384
[2024-06-03 22:10:36,177 INFO  L175             Difference]: Start difference. First operand has 62 places, 56 transitions, 258 flow. Second operand 5 states and 118 transitions.
[2024-06-03 22:10:36,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 470 flow
[2024-06-03 22:10:36,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 424 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-03 22:10:36,184 INFO  L231             Difference]: Finished difference. Result has 63 places, 60 transitions, 277 flow
[2024-06-03 22:10:36,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=63, PETRI_TRANSITIONS=60}
[2024-06-03 22:10:36,190 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places.
[2024-06-03 22:10:36,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 277 flow
[2024-06-03 22:10:36,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:10:36,190 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:10:36,190 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:10:36,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:10:36,191 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-03 22:10:36,191 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:10:36,191 INFO  L85        PathProgramCache]: Analyzing trace with hash -1039331939, now seen corresponding path program 1 times
[2024-06-03 22:10:36,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:10:36,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030511867]
[2024-06-03 22:10:36,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:10:36,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:10:36,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:10:48,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:10:48,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:10:48,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030511867]
[2024-06-03 22:10:48,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030511867] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:10:48,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:10:48,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:10:48,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587819634]
[2024-06-03 22:10:48,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:10:48,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:10:48,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:10:48,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:10:48,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:10:48,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:10:48,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 277 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:10:48,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:10:48,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:10:48,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:10:54,044 INFO  L124   PetriNetUnfolderBase]: 11562/15702 cut-off events.
[2024-06-03 22:10:54,044 INFO  L125   PetriNetUnfolderBase]: For 36223/36223 co-relation queries the response was YES.
[2024-06-03 22:10:54,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50570 conditions, 15702 events. 11562/15702 cut-off events. For 36223/36223 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81551 event pairs, 6742 based on Foata normal form. 3/15703 useless extension candidates. Maximal degree in co-relation 50549. Up to 15601 conditions per place. 
[2024-06-03 22:10:54,110 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 72 selfloop transitions, 14 changer transitions 0/91 dead transitions.
[2024-06-03 22:10:54,110 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 551 flow
[2024-06-03 22:10:54,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:10:54,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:10:54,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-06-03 22:10:54,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4423076923076923
[2024-06-03 22:10:54,112 INFO  L175             Difference]: Start difference. First operand has 63 places, 60 transitions, 277 flow. Second operand 6 states and 138 transitions.
[2024-06-03 22:10:54,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 551 flow
[2024-06-03 22:10:54,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 518 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-03 22:10:54,117 INFO  L231             Difference]: Finished difference. Result has 66 places, 64 transitions, 323 flow
[2024-06-03 22:10:54,117 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=66, PETRI_TRANSITIONS=64}
[2024-06-03 22:10:54,118 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places.
[2024-06-03 22:10:54,118 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 323 flow
[2024-06-03 22:10:54,118 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:10:54,118 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:10:54,118 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:10:54,118 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:10:54,118 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-03 22:10:54,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:10:54,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -1033618019, now seen corresponding path program 2 times
[2024-06-03 22:10:54,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:10:54,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295074514]
[2024-06-03 22:10:54,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:10:54,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:10:54,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:11:06,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:11:06,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:11:06,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295074514]
[2024-06-03 22:11:06,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295074514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:11:06,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:11:06,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:11:06,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045138037]
[2024-06-03 22:11:06,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:11:06,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:11:06,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:11:06,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:11:06,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:11:07,026 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:11:07,027 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 323 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:07,027 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:11:07,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:11:07,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:11:12,328 INFO  L124   PetriNetUnfolderBase]: 11553/15693 cut-off events.
[2024-06-03 22:11:12,329 INFO  L125   PetriNetUnfolderBase]: For 48964/48980 co-relation queries the response was YES.
[2024-06-03 22:11:12,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54396 conditions, 15693 events. 11553/15693 cut-off events. For 48964/48980 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81459 event pairs, 6702 based on Foata normal form. 15/15704 useless extension candidates. Maximal degree in co-relation 54374. Up to 15559 conditions per place. 
[2024-06-03 22:11:12,388 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 66 selfloop transitions, 21 changer transitions 0/92 dead transitions.
[2024-06-03 22:11:12,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 599 flow
[2024-06-03 22:11:12,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:11:12,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:11:12,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-06-03 22:11:12,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4391025641025641
[2024-06-03 22:11:12,389 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 323 flow. Second operand 6 states and 137 transitions.
[2024-06-03 22:11:12,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 599 flow
[2024-06-03 22:11:12,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 552 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-03 22:11:12,396 INFO  L231             Difference]: Finished difference. Result has 68 places, 68 transitions, 377 flow
[2024-06-03 22:11:12,396 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=68, PETRI_TRANSITIONS=68}
[2024-06-03 22:11:12,397 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places.
[2024-06-03 22:11:12,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 377 flow
[2024-06-03 22:11:12,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:12,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:11:12,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:11:12,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:11:12,398 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-03 22:11:12,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:11:12,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -313263703, now seen corresponding path program 1 times
[2024-06-03 22:11:12,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:11:12,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007687005]
[2024-06-03 22:11:12,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:11:12,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:11:12,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:11:24,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:11:24,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:11:24,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007687005]
[2024-06-03 22:11:24,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007687005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:11:24,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:11:24,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:11:24,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303529913]
[2024-06-03 22:11:24,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:11:24,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:11:24,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:11:24,953 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:11:24,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:11:25,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:11:25,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 377 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:25,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:11:25,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:11:25,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:11:30,777 INFO  L124   PetriNetUnfolderBase]: 11976/16592 cut-off events.
[2024-06-03 22:11:30,777 INFO  L125   PetriNetUnfolderBase]: For 63649/63649 co-relation queries the response was YES.
[2024-06-03 22:11:30,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60320 conditions, 16592 events. 11976/16592 cut-off events. For 63649/63649 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 89343 event pairs, 6810 based on Foata normal form. 3/16593 useless extension candidates. Maximal degree in co-relation 60297. Up to 16170 conditions per place. 
[2024-06-03 22:11:30,850 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 78 selfloop transitions, 14 changer transitions 0/97 dead transitions.
[2024-06-03 22:11:30,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 665 flow
[2024-06-03 22:11:30,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:11:30,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:11:30,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions.
[2024-06-03 22:11:30,851 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4358974358974359
[2024-06-03 22:11:30,851 INFO  L175             Difference]: Start difference. First operand has 68 places, 68 transitions, 377 flow. Second operand 6 states and 136 transitions.
[2024-06-03 22:11:30,851 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 665 flow
[2024-06-03 22:11:30,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 97 transitions, 596 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 22:11:30,862 INFO  L231             Difference]: Finished difference. Result has 70 places, 72 transitions, 395 flow
[2024-06-03 22:11:30,862 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=70, PETRI_TRANSITIONS=72}
[2024-06-03 22:11:30,863 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places.
[2024-06-03 22:11:30,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 395 flow
[2024-06-03 22:11:30,863 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:30,863 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:11:30,863 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:11:30,863 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:11:30,863 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:11:30,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:11:30,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140329991, now seen corresponding path program 1 times
[2024-06-03 22:11:30,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:11:30,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675884690]
[2024-06-03 22:11:30,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:11:30,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:11:30,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:11:42,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:11:42,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:11:42,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675884690]
[2024-06-03 22:11:42,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675884690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:11:42,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:11:42,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:11:42,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614950585]
[2024-06-03 22:11:42,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:11:42,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:11:42,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:11:42,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:11:42,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:11:42,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:11:42,648 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 395 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:42,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:11:42,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:11:42,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:11:48,034 INFO  L124   PetriNetUnfolderBase]: 11588/15738 cut-off events.
[2024-06-03 22:11:48,034 INFO  L125   PetriNetUnfolderBase]: For 81257/81257 co-relation queries the response was YES.
[2024-06-03 22:11:48,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62216 conditions, 15738 events. 11588/15738 cut-off events. For 81257/81257 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 81907 event pairs, 5781 based on Foata normal form. 6/15742 useless extension candidates. Maximal degree in co-relation 62192. Up to 15580 conditions per place. 
[2024-06-03 22:11:48,097 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 91 selfloop transitions, 22 changer transitions 0/118 dead transitions.
[2024-06-03 22:11:48,097 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 781 flow
[2024-06-03 22:11:48,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:11:48,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:11:48,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-06-03 22:11:48,100 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45054945054945056
[2024-06-03 22:11:48,100 INFO  L175             Difference]: Start difference. First operand has 70 places, 72 transitions, 395 flow. Second operand 7 states and 164 transitions.
[2024-06-03 22:11:48,100 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 781 flow
[2024-06-03 22:11:48,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 118 transitions, 726 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 22:11:48,108 INFO  L231             Difference]: Finished difference. Result has 74 places, 80 transitions, 472 flow
[2024-06-03 22:11:48,109 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=74, PETRI_TRANSITIONS=80}
[2024-06-03 22:11:48,109 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places.
[2024-06-03 22:11:48,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 472 flow
[2024-06-03 22:11:48,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:11:48,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:11:48,110 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:11:48,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:11:48,110 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:11:48,110 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:11:48,110 INFO  L85        PathProgramCache]: Analyzing trace with hash -1127913605, now seen corresponding path program 2 times
[2024-06-03 22:11:48,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:11:48,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836708198]
[2024-06-03 22:11:48,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:11:48,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:11:48,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:12:00,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:12:00,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:12:00,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836708198]
[2024-06-03 22:12:00,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836708198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:12:00,071 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:12:00,071 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:12:00,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034859233]
[2024-06-03 22:12:00,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:12:00,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:12:00,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:12:00,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:12:00,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:12:00,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:12:00,275 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 472 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:00,275 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:12:00,275 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:12:00,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:12:05,828 INFO  L124   PetriNetUnfolderBase]: 11812/16044 cut-off events.
[2024-06-03 22:12:05,828 INFO  L125   PetriNetUnfolderBase]: For 105887/105887 co-relation queries the response was YES.
[2024-06-03 22:12:05,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68534 conditions, 16044 events. 11812/16044 cut-off events. For 105887/105887 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 83609 event pairs, 5556 based on Foata normal form. 12/16054 useless extension candidates. Maximal degree in co-relation 68508. Up to 15695 conditions per place. 
[2024-06-03 22:12:05,901 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 93 selfloop transitions, 32 changer transitions 0/130 dead transitions.
[2024-06-03 22:12:05,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 1006 flow
[2024-06-03 22:12:05,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:12:05,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:12:05,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions.
[2024-06-03 22:12:05,904 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 22:12:05,904 INFO  L175             Difference]: Start difference. First operand has 74 places, 80 transitions, 472 flow. Second operand 7 states and 169 transitions.
[2024-06-03 22:12:05,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 1006 flow
[2024-06-03 22:12:05,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 130 transitions, 942 flow, removed 20 selfloop flow, removed 3 redundant places.
[2024-06-03 22:12:05,922 INFO  L231             Difference]: Finished difference. Result has 79 places, 90 transitions, 630 flow
[2024-06-03 22:12:05,922 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=79, PETRI_TRANSITIONS=90}
[2024-06-03 22:12:05,923 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places.
[2024-06-03 22:12:05,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 630 flow
[2024-06-03 22:12:05,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:05,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:12:05,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:12:05,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:12:05,924 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-03 22:12:05,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:12:05,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -1616408931, now seen corresponding path program 3 times
[2024-06-03 22:12:05,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:12:05,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323818226]
[2024-06-03 22:12:05,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:12:05,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:12:05,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:12:17,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:12:17,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:12:17,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323818226]
[2024-06-03 22:12:17,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323818226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:12:17,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:12:17,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:12:17,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062373024]
[2024-06-03 22:12:17,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:12:17,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:12:17,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:12:17,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:12:17,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:12:17,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:12:17,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 630 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:17,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:12:17,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:12:17,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:12:23,617 INFO  L124   PetriNetUnfolderBase]: 11850/16106 cut-off events.
[2024-06-03 22:12:23,618 INFO  L125   PetriNetUnfolderBase]: For 134006/134020 co-relation queries the response was YES.
[2024-06-03 22:12:23,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74389 conditions, 16106 events. 11850/16106 cut-off events. For 134006/134020 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 83915 event pairs, 5180 based on Foata normal form. 20/16118 useless extension candidates. Maximal degree in co-relation 74361. Up to 15565 conditions per place. 
[2024-06-03 22:12:23,688 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 88 selfloop transitions, 48 changer transitions 0/141 dead transitions.
[2024-06-03 22:12:23,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 1276 flow
[2024-06-03 22:12:23,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:12:23,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:12:23,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions.
[2024-06-03 22:12:23,690 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47802197802197804
[2024-06-03 22:12:23,690 INFO  L175             Difference]: Start difference. First operand has 79 places, 90 transitions, 630 flow. Second operand 7 states and 174 transitions.
[2024-06-03 22:12:23,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 1276 flow
[2024-06-03 22:12:23,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1208 flow, removed 25 selfloop flow, removed 3 redundant places.
[2024-06-03 22:12:23,715 INFO  L231             Difference]: Finished difference. Result has 84 places, 100 transitions, 832 flow
[2024-06-03 22:12:23,715 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=84, PETRI_TRANSITIONS=100}
[2024-06-03 22:12:23,715 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places.
[2024-06-03 22:12:23,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 100 transitions, 832 flow
[2024-06-03 22:12:23,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:23,716 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:12:23,716 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:12:23,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:12:23,716 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-03 22:12:23,717 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:12:23,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121238251, now seen corresponding path program 1 times
[2024-06-03 22:12:23,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:12:23,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310736082]
[2024-06-03 22:12:23,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:12:23,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:12:23,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:12:38,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:12:38,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:12:38,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310736082]
[2024-06-03 22:12:38,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310736082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:12:38,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:12:38,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:12:38,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068430345]
[2024-06-03 22:12:38,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:12:38,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:12:38,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:12:38,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:12:38,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:12:38,546 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:12:38,546 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 100 transitions, 832 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:38,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:12:38,546 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:12:38,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:12:44,536 INFO  L124   PetriNetUnfolderBase]: 12368/16998 cut-off events.
[2024-06-03 22:12:44,536 INFO  L125   PetriNetUnfolderBase]: For 163378/163378 co-relation queries the response was YES.
[2024-06-03 22:12:44,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82276 conditions, 16998 events. 12368/16998 cut-off events. For 163378/163378 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 90611 event pairs, 5484 based on Foata normal form. 6/17002 useless extension candidates. Maximal degree in co-relation 82245. Up to 16677 conditions per place. 
[2024-06-03 22:12:44,627 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 114 selfloop transitions, 17 changer transitions 0/136 dead transitions.
[2024-06-03 22:12:44,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1234 flow
[2024-06-03 22:12:44,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:12:44,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:12:44,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions.
[2024-06-03 22:12:44,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43131868131868134
[2024-06-03 22:12:44,630 INFO  L175             Difference]: Start difference. First operand has 84 places, 100 transitions, 832 flow. Second operand 7 states and 157 transitions.
[2024-06-03 22:12:44,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1234 flow
[2024-06-03 22:12:44,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 1088 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-03 22:12:44,686 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 792 flow
[2024-06-03 22:12:44,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2024-06-03 22:12:44,686 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places.
[2024-06-03 22:12:44,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 792 flow
[2024-06-03 22:12:44,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:12:44,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:12:44,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:12:44,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:12:44,687 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-03 22:12:44,687 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:12:44,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 1021832867, now seen corresponding path program 1 times
[2024-06-03 22:12:44,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:12:44,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009041493]
[2024-06-03 22:12:44,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:12:44,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:12:44,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:13:05,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:13:05,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:13:05,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009041493]
[2024-06-03 22:13:05,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009041493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:13:05,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:13:05,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:13:05,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366761626]
[2024-06-03 22:13:05,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:13:05,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:13:05,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:13:05,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:13:05,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:13:06,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:13:06,011 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 792 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:06,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:13:06,011 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:13:06,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:13:11,770 INFO  L124   PetriNetUnfolderBase]: 12361/17147 cut-off events.
[2024-06-03 22:13:11,770 INFO  L125   PetriNetUnfolderBase]: For 165887/165887 co-relation queries the response was YES.
[2024-06-03 22:13:11,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81989 conditions, 17147 events. 12361/17147 cut-off events. For 165887/165887 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 92278 event pairs, 5692 based on Foata normal form. 2/17147 useless extension candidates. Maximal degree in co-relation 81957. Up to 16734 conditions per place. 
[2024-06-03 22:13:11,858 INFO  L140   encePairwiseOnDemand]: 43/52 looper letters, 106 selfloop transitions, 10 changer transitions 0/121 dead transitions.
[2024-06-03 22:13:11,858 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 121 transitions, 1106 flow
[2024-06-03 22:13:11,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:13:11,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:13:11,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions.
[2024-06-03 22:13:11,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4230769230769231
[2024-06-03 22:13:11,859 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 792 flow. Second operand 5 states and 110 transitions.
[2024-06-03 22:13:11,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 121 transitions, 1106 flow
[2024-06-03 22:13:11,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 121 transitions, 1030 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-03 22:13:11,895 INFO  L231             Difference]: Finished difference. Result has 87 places, 107 transitions, 799 flow
[2024-06-03 22:13:11,896 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=799, PETRI_PLACES=87, PETRI_TRANSITIONS=107}
[2024-06-03 22:13:11,896 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places.
[2024-06-03 22:13:11,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 107 transitions, 799 flow
[2024-06-03 22:13:11,896 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:11,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:13:11,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:13:11,897 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:13:11,897 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-03 22:13:11,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:13:11,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 427331314, now seen corresponding path program 1 times
[2024-06-03 22:13:11,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:13:11,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783418116]
[2024-06-03 22:13:11,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:13:11,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:13:11,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:13:23,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:13:23,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:13:23,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783418116]
[2024-06-03 22:13:23,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783418116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:13:23,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:13:23,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:13:23,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334782412]
[2024-06-03 22:13:23,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:13:23,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:13:23,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:13:23,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:13:23,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:13:23,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:13:23,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 107 transitions, 799 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:23,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:13:23,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:13:23,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:13:29,664 INFO  L124   PetriNetUnfolderBase]: 11819/16056 cut-off events.
[2024-06-03 22:13:29,664 INFO  L125   PetriNetUnfolderBase]: For 188162/188162 co-relation queries the response was YES.
[2024-06-03 22:13:29,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82651 conditions, 16056 events. 11819/16056 cut-off events. For 188162/188162 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 83614 event pairs, 5119 based on Foata normal form. 3/16057 useless extension candidates. Maximal degree in co-relation 82618. Up to 15883 conditions per place. 
[2024-06-03 22:13:29,759 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 119 selfloop transitions, 25 changer transitions 0/149 dead transitions.
[2024-06-03 22:13:29,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 149 transitions, 1256 flow
[2024-06-03 22:13:29,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:13:29,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:13:29,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-06-03 22:13:29,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45054945054945056
[2024-06-03 22:13:29,763 INFO  L175             Difference]: Start difference. First operand has 87 places, 107 transitions, 799 flow. Second operand 7 states and 164 transitions.
[2024-06-03 22:13:29,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 149 transitions, 1256 flow
[2024-06-03 22:13:29,799 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 149 transitions, 1203 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-03 22:13:29,801 INFO  L231             Difference]: Finished difference. Result has 91 places, 111 transitions, 889 flow
[2024-06-03 22:13:29,801 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=889, PETRI_PLACES=91, PETRI_TRANSITIONS=111}
[2024-06-03 22:13:29,801 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places.
[2024-06-03 22:13:29,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 889 flow
[2024-06-03 22:13:29,802 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:29,802 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:13:29,802 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:13:29,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:13:29,802 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-03 22:13:29,802 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:13:29,802 INFO  L85        PathProgramCache]: Analyzing trace with hash 431146546, now seen corresponding path program 1 times
[2024-06-03 22:13:29,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:13:29,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954921298]
[2024-06-03 22:13:29,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:13:29,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:13:29,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:13:43,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:13:43,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:13:43,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954921298]
[2024-06-03 22:13:43,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954921298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:13:43,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:13:43,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:13:43,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716445211]
[2024-06-03 22:13:43,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:13:43,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:13:43,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:13:43,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:13:43,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:13:43,574 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:13:43,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 889 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:43,575 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:13:43,575 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:13:43,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:13:50,442 INFO  L124   PetriNetUnfolderBase]: 14374/19406 cut-off events.
[2024-06-03 22:13:50,442 INFO  L125   PetriNetUnfolderBase]: For 243969/243969 co-relation queries the response was YES.
[2024-06-03 22:13:50,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99669 conditions, 19406 events. 14374/19406 cut-off events. For 243969/243969 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 99906 event pairs, 6849 based on Foata normal form. 3/19407 useless extension candidates. Maximal degree in co-relation 99635. Up to 19323 conditions per place. 
[2024-06-03 22:13:50,550 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 127 selfloop transitions, 18 changer transitions 0/149 dead transitions.
[2024-06-03 22:13:50,550 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 149 transitions, 1326 flow
[2024-06-03 22:13:50,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:13:50,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:13:50,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-03 22:13:50,566 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4230769230769231
[2024-06-03 22:13:50,566 INFO  L175             Difference]: Start difference. First operand has 91 places, 111 transitions, 889 flow. Second operand 7 states and 154 transitions.
[2024-06-03 22:13:50,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 149 transitions, 1326 flow
[2024-06-03 22:13:50,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 149 transitions, 1242 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 22:13:50,644 INFO  L231             Difference]: Finished difference. Result has 93 places, 114 transitions, 915 flow
[2024-06-03 22:13:50,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=915, PETRI_PLACES=93, PETRI_TRANSITIONS=114}
[2024-06-03 22:13:50,645 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places.
[2024-06-03 22:13:50,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 915 flow
[2024-06-03 22:13:50,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:13:50,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:13:50,645 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:13:50,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:13:50,646 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-03 22:13:50,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:13:50,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1431140186, now seen corresponding path program 2 times
[2024-06-03 22:13:50,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:13:50,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295243933]
[2024-06-03 22:13:50,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:13:50,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:13:50,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:14:05,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:14:05,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:14:05,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295243933]
[2024-06-03 22:14:05,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295243933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:14:05,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:14:05,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:14:05,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107076917]
[2024-06-03 22:14:05,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:14:05,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:14:05,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:14:05,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:14:05,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:14:05,455 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:14:05,455 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 915 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:14:05,455 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:14:05,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:14:05,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:14:12,720 INFO  L124   PetriNetUnfolderBase]: 14396/19439 cut-off events.
[2024-06-03 22:14:12,720 INFO  L125   PetriNetUnfolderBase]: For 264718/264736 co-relation queries the response was YES.
[2024-06-03 22:14:12,753 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101214 conditions, 19439 events. 14396/19439 cut-off events. For 264718/264736 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 99913 event pairs, 6391 based on Foata normal form. 17/19452 useless extension candidates. Maximal degree in co-relation 101179. Up to 19285 conditions per place. 
[2024-06-03 22:14:12,823 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 122 selfloop transitions, 25 changer transitions 0/151 dead transitions.
[2024-06-03 22:14:12,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 151 transitions, 1358 flow
[2024-06-03 22:14:12,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:14:12,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:14:12,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-03 22:14:12,826 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4230769230769231
[2024-06-03 22:14:12,826 INFO  L175             Difference]: Start difference. First operand has 93 places, 114 transitions, 915 flow. Second operand 7 states and 154 transitions.
[2024-06-03 22:14:12,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 151 transitions, 1358 flow
[2024-06-03 22:14:12,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 151 transitions, 1279 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-03 22:14:12,890 INFO  L231             Difference]: Finished difference. Result has 95 places, 118 transitions, 970 flow
[2024-06-03 22:14:12,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=970, PETRI_PLACES=95, PETRI_TRANSITIONS=118}
[2024-06-03 22:14:12,891 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places.
[2024-06-03 22:14:12,891 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 118 transitions, 970 flow
[2024-06-03 22:14:12,891 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:14:12,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:14:12,892 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:14:12,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:14:12,892 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:14:12,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:14:12,892 INFO  L85        PathProgramCache]: Analyzing trace with hash 1431147626, now seen corresponding path program 3 times
[2024-06-03 22:14:12,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:14:12,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999890244]
[2024-06-03 22:14:12,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:14:12,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:14:12,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:14:27,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:14:27,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:14:27,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999890244]
[2024-06-03 22:14:27,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999890244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:14:27,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:14:27,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:14:27,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199904881]
[2024-06-03 22:14:27,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:14:27,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:14:27,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:14:27,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:14:27,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:14:27,300 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:14:27,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 118 transitions, 970 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:14:27,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:14:27,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:14:27,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:14:34,424 INFO  L124   PetriNetUnfolderBase]: 14375/19409 cut-off events.
[2024-06-03 22:14:34,424 INFO  L125   PetriNetUnfolderBase]: For 286430/286448 co-relation queries the response was YES.
[2024-06-03 22:14:34,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102578 conditions, 19409 events. 14375/19409 cut-off events. For 286430/286448 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 99858 event pairs, 6399 based on Foata normal form. 17/19422 useless extension candidates. Maximal degree in co-relation 102542. Up to 19210 conditions per place. 
[2024-06-03 22:14:34,535 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 113 selfloop transitions, 36 changer transitions 0/153 dead transitions.
[2024-06-03 22:14:34,535 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 153 transitions, 1409 flow
[2024-06-03 22:14:34,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:14:34,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:14:34,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-03 22:14:34,538 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4230769230769231
[2024-06-03 22:14:34,538 INFO  L175             Difference]: Start difference. First operand has 95 places, 118 transitions, 970 flow. Second operand 7 states and 154 transitions.
[2024-06-03 22:14:34,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 153 transitions, 1409 flow
[2024-06-03 22:14:34,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 153 transitions, 1320 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 22:14:34,629 INFO  L231             Difference]: Finished difference. Result has 97 places, 121 transitions, 1029 flow
[2024-06-03 22:14:34,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1029, PETRI_PLACES=97, PETRI_TRANSITIONS=121}
[2024-06-03 22:14:34,629 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places.
[2024-06-03 22:14:34,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 121 transitions, 1029 flow
[2024-06-03 22:14:34,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:14:34,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:14:34,630 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:14:34,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:14:34,630 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-03 22:14:34,631 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:14:34,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1612049309, now seen corresponding path program 1 times
[2024-06-03 22:14:34,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:14:34,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367420400]
[2024-06-03 22:14:34,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:14:34,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:14:34,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:14:58,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:14:58,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:14:58,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367420400]
[2024-06-03 22:14:58,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367420400] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:14:58,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:14:58,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:14:58,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573650764]
[2024-06-03 22:14:58,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:14:58,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:14:58,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:14:58,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:14:58,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:14:59,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:14:59,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 121 transitions, 1029 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:14:59,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:14:59,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:14:59,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:15:05,508 INFO  L124   PetriNetUnfolderBase]: 12349/17153 cut-off events.
[2024-06-03 22:15:05,509 INFO  L125   PetriNetUnfolderBase]: For 257263/257263 co-relation queries the response was YES.
[2024-06-03 22:15:05,541 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91182 conditions, 17153 events. 12349/17153 cut-off events. For 257263/257263 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 92466 event pairs, 5543 based on Foata normal form. 8/17158 useless extension candidates. Maximal degree in co-relation 91145. Up to 16626 conditions per place. 
[2024-06-03 22:15:05,603 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 133 selfloop transitions, 22 changer transitions 0/160 dead transitions.
[2024-06-03 22:15:05,604 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 160 transitions, 1603 flow
[2024-06-03 22:15:05,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:15:05,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:15:05,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-06-03 22:15:05,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44551282051282054
[2024-06-03 22:15:05,607 INFO  L175             Difference]: Start difference. First operand has 97 places, 121 transitions, 1029 flow. Second operand 6 states and 139 transitions.
[2024-06-03 22:15:05,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 160 transitions, 1603 flow
[2024-06-03 22:15:05,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 160 transitions, 1484 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-03 22:15:05,696 INFO  L231             Difference]: Finished difference. Result has 100 places, 135 transitions, 1134 flow
[2024-06-03 22:15:05,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1134, PETRI_PLACES=100, PETRI_TRANSITIONS=135}
[2024-06-03 22:15:05,696 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places.
[2024-06-03 22:15:05,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 1134 flow
[2024-06-03 22:15:05,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:15:05,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:15:05,697 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:15:05,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:15:05,697 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:15:05,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:15:05,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -321453536, now seen corresponding path program 1 times
[2024-06-03 22:15:05,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:15:05,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896534380]
[2024-06-03 22:15:05,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:15:05,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:15:05,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:15:19,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:15:19,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:15:19,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896534380]
[2024-06-03 22:15:19,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896534380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:15:19,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:15:19,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:15:19,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310052844]
[2024-06-03 22:15:19,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:15:19,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:15:19,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:15:19,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:15:19,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:15:20,160 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:15:20,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 1134 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:15:20,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:15:20,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:15:20,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:15:26,152 INFO  L124   PetriNetUnfolderBase]: 11881/16138 cut-off events.
[2024-06-03 22:15:26,152 INFO  L125   PetriNetUnfolderBase]: For 303629/303629 co-relation queries the response was YES.
[2024-06-03 22:15:26,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94458 conditions, 16138 events. 11881/16138 cut-off events. For 303629/303629 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 84212 event pairs, 4246 based on Foata normal form. 6/16142 useless extension candidates. Maximal degree in co-relation 94418. Up to 15930 conditions per place. 
[2024-06-03 22:15:26,261 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 156 selfloop transitions, 23 changer transitions 0/184 dead transitions.
[2024-06-03 22:15:26,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 184 transitions, 1680 flow
[2024-06-03 22:15:26,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:15:26,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:15:26,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-06-03 22:15:26,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4423076923076923
[2024-06-03 22:15:26,264 INFO  L175             Difference]: Start difference. First operand has 100 places, 135 transitions, 1134 flow. Second operand 8 states and 184 transitions.
[2024-06-03 22:15:26,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 184 transitions, 1680 flow
[2024-06-03 22:15:26,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 184 transitions, 1634 flow, removed 22 selfloop flow, removed 1 redundant places.
[2024-06-03 22:15:26,382 INFO  L231             Difference]: Finished difference. Result has 107 places, 138 transitions, 1220 flow
[2024-06-03 22:15:26,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1220, PETRI_PLACES=107, PETRI_TRANSITIONS=138}
[2024-06-03 22:15:26,382 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places.
[2024-06-03 22:15:26,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 138 transitions, 1220 flow
[2024-06-03 22:15:26,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:15:26,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:15:26,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:15:26,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:15:26,383 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:15:26,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:15:26,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -434954456, now seen corresponding path program 2 times
[2024-06-03 22:15:26,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:15:26,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053500669]
[2024-06-03 22:15:26,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:15:26,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:15:26,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:15:40,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:15:40,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:15:40,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053500669]
[2024-06-03 22:15:40,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053500669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:15:40,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:15:40,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:15:40,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438977693]
[2024-06-03 22:15:40,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:15:40,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:15:40,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:15:40,874 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:15:40,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:15:41,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:15:41,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 138 transitions, 1220 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:15:41,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:15:41,122 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:15:41,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:15:47,440 INFO  L124   PetriNetUnfolderBase]: 11917/16190 cut-off events.
[2024-06-03 22:15:47,440 INFO  L125   PetriNetUnfolderBase]: For 339146/339146 co-relation queries the response was YES.
[2024-06-03 22:15:47,470 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97784 conditions, 16190 events. 11917/16190 cut-off events. For 339146/339146 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 84379 event pairs, 4912 based on Foata normal form. 6/16194 useless extension candidates. Maximal degree in co-relation 97741. Up to 15979 conditions per place. 
[2024-06-03 22:15:47,537 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 154 selfloop transitions, 28 changer transitions 0/187 dead transitions.
[2024-06-03 22:15:47,537 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 187 transitions, 1780 flow
[2024-06-03 22:15:47,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:15:47,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:15:47,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions.
[2024-06-03 22:15:47,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44471153846153844
[2024-06-03 22:15:47,540 INFO  L175             Difference]: Start difference. First operand has 107 places, 138 transitions, 1220 flow. Second operand 8 states and 185 transitions.
[2024-06-03 22:15:47,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 187 transitions, 1780 flow
[2024-06-03 22:15:47,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 187 transitions, 1674 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-03 22:15:47,666 INFO  L231             Difference]: Finished difference. Result has 109 places, 141 transitions, 1263 flow
[2024-06-03 22:15:47,667 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1263, PETRI_PLACES=109, PETRI_TRANSITIONS=141}
[2024-06-03 22:15:47,667 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places.
[2024-06-03 22:15:47,667 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 141 transitions, 1263 flow
[2024-06-03 22:15:47,667 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:15:47,668 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:15:47,668 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:15:47,668 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:15:47,668 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-03 22:15:47,668 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:15:47,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -432152986, now seen corresponding path program 1 times
[2024-06-03 22:15:47,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:15:47,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272581804]
[2024-06-03 22:15:47,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:15:47,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:15:47,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:16:00,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:16:00,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:16:00,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272581804]
[2024-06-03 22:16:00,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272581804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:16:00,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:16:00,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:16:00,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131268267]
[2024-06-03 22:16:00,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:16:00,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:16:00,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:16:00,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:16:00,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:16:01,203 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:16:01,203 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 141 transitions, 1263 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:01,203 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:16:01,203 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:16:01,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:16:08,253 INFO  L124   PetriNetUnfolderBase]: 14547/19650 cut-off events.
[2024-06-03 22:16:08,253 INFO  L125   PetriNetUnfolderBase]: For 443700/443700 co-relation queries the response was YES.
[2024-06-03 22:16:08,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118320 conditions, 19650 events. 14547/19650 cut-off events. For 443700/443700 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 101207 event pairs, 6896 based on Foata normal form. 6/19654 useless extension candidates. Maximal degree in co-relation 118276. Up to 19289 conditions per place. 
[2024-06-03 22:16:08,382 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 138 selfloop transitions, 39 changer transitions 0/181 dead transitions.
[2024-06-03 22:16:08,383 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 181 transitions, 1730 flow
[2024-06-03 22:16:08,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:16:08,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:16:08,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions.
[2024-06-03 22:16:08,386 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43956043956043955
[2024-06-03 22:16:08,386 INFO  L175             Difference]: Start difference. First operand has 109 places, 141 transitions, 1263 flow. Second operand 7 states and 160 transitions.
[2024-06-03 22:16:08,386 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 181 transitions, 1730 flow
[2024-06-03 22:16:08,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 181 transitions, 1577 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-03 22:16:08,625 INFO  L231             Difference]: Finished difference. Result has 111 places, 144 transitions, 1245 flow
[2024-06-03 22:16:08,625 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1245, PETRI_PLACES=111, PETRI_TRANSITIONS=144}
[2024-06-03 22:16:08,625 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places.
[2024-06-03 22:16:08,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 144 transitions, 1245 flow
[2024-06-03 22:16:08,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:08,626 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:16:08,626 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:16:08,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:16:08,626 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:16:08,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:16:08,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 519595904, now seen corresponding path program 1 times
[2024-06-03 22:16:08,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:16:08,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36038676]
[2024-06-03 22:16:08,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:16:08,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:16:08,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:16:22,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-03 22:16:22,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:16:22,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36038676]
[2024-06-03 22:16:22,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36038676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:16:22,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:16:22,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:16:22,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685053684]
[2024-06-03 22:16:22,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:16:22,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:16:22,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:16:22,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:16:22,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:16:23,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:16:23,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 144 transitions, 1245 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:23,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:16:23,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:16:23,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:16:31,283 INFO  L124   PetriNetUnfolderBase]: 14583/19702 cut-off events.
[2024-06-03 22:16:31,283 INFO  L125   PetriNetUnfolderBase]: For 470631/470631 co-relation queries the response was YES.
[2024-06-03 22:16:31,324 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 119963 conditions, 19702 events. 14583/19702 cut-off events. For 470631/470631 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 101275 event pairs, 6532 based on Foata normal form. 6/19706 useless extension candidates. Maximal degree in co-relation 119917. Up to 19589 conditions per place. 
[2024-06-03 22:16:31,399 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 165 selfloop transitions, 21 changer transitions 0/190 dead transitions.
[2024-06-03 22:16:31,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 190 transitions, 1801 flow
[2024-06-03 22:16:31,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:16:31,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:16:31,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions.
[2024-06-03 22:16:31,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4182692307692308
[2024-06-03 22:16:31,402 INFO  L175             Difference]: Start difference. First operand has 111 places, 144 transitions, 1245 flow. Second operand 8 states and 174 transitions.
[2024-06-03 22:16:31,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 190 transitions, 1801 flow
[2024-06-03 22:16:31,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 190 transitions, 1710 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-03 22:16:31,596 INFO  L231             Difference]: Finished difference. Result has 114 places, 147 transitions, 1286 flow
[2024-06-03 22:16:31,596 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1286, PETRI_PLACES=114, PETRI_TRANSITIONS=147}
[2024-06-03 22:16:31,596 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places.
[2024-06-03 22:16:31,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 147 transitions, 1286 flow
[2024-06-03 22:16:31,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:31,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:16:31,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:16:31,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:16:31,597 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:16:31,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:16:31,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -316866776, now seen corresponding path program 3 times
[2024-06-03 22:16:31,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:16:31,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48611248]
[2024-06-03 22:16:31,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:16:31,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:16:31,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:16:45,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:16:45,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:16:45,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48611248]
[2024-06-03 22:16:45,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48611248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:16:45,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:16:45,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:16:45,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331956901]
[2024-06-03 22:16:45,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:16:45,408 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:16:45,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:16:45,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:16:45,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:16:45,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:16:45,599 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 147 transitions, 1286 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:45,599 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:16:45,599 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:16:45,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:16:52,006 INFO  L124   PetriNetUnfolderBase]: 11971/16270 cut-off events.
[2024-06-03 22:16:52,006 INFO  L125   PetriNetUnfolderBase]: For 415992/415992 co-relation queries the response was YES.
[2024-06-03 22:16:52,042 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103837 conditions, 16270 events. 11971/16270 cut-off events. For 415992/415992 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 84731 event pairs, 4864 based on Foata normal form. 6/16274 useless extension candidates. Maximal degree in co-relation 103790. Up to 16022 conditions per place. 
[2024-06-03 22:16:52,112 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 154 selfloop transitions, 35 changer transitions 0/194 dead transitions.
[2024-06-03 22:16:52,112 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 1866 flow
[2024-06-03 22:16:52,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:16:52,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:16:52,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions.
[2024-06-03 22:16:52,115 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44471153846153844
[2024-06-03 22:16:52,115 INFO  L175             Difference]: Start difference. First operand has 114 places, 147 transitions, 1286 flow. Second operand 8 states and 185 transitions.
[2024-06-03 22:16:52,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 1866 flow
[2024-06-03 22:16:52,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 194 transitions, 1760 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-03 22:16:52,268 INFO  L231             Difference]: Finished difference. Result has 116 places, 150 transitions, 1352 flow
[2024-06-03 22:16:52,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1352, PETRI_PLACES=116, PETRI_TRANSITIONS=150}
[2024-06-03 22:16:52,268 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places.
[2024-06-03 22:16:52,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 150 transitions, 1352 flow
[2024-06-03 22:16:52,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:16:52,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:16:52,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:16:52,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:16:52,269 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:16:52,269 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:16:52,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -1577519166, now seen corresponding path program 1 times
[2024-06-03 22:16:52,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:16:52,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056316351]
[2024-06-03 22:16:52,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:16:52,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:16:52,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:17:16,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-03 22:17:16,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:17:16,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056316351]
[2024-06-03 22:17:16,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056316351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:17:16,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:17:16,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:17:16,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120865137]
[2024-06-03 22:17:16,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:17:16,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:17:16,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:17:16,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:17:16,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:17:17,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:17:17,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 150 transitions, 1352 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:17:17,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:17:17,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:17:17,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:17:24,388 INFO  L124   PetriNetUnfolderBase]: 14671/19827 cut-off events.
[2024-06-03 22:17:24,388 INFO  L125   PetriNetUnfolderBase]: For 540570/540570 co-relation queries the response was YES.
[2024-06-03 22:17:24,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126160 conditions, 19827 events. 14671/19827 cut-off events. For 540570/540570 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 101876 event pairs, 6316 based on Foata normal form. 2/19827 useless extension candidates. Maximal degree in co-relation 126112. Up to 19760 conditions per place. 
[2024-06-03 22:17:24,532 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 166 selfloop transitions, 22 changer transitions 0/192 dead transitions.
[2024-06-03 22:17:24,532 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 192 transitions, 2042 flow
[2024-06-03 22:17:24,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:17:24,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:17:24,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-03 22:17:24,533 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39663461538461536
[2024-06-03 22:17:24,533 INFO  L175             Difference]: Start difference. First operand has 116 places, 150 transitions, 1352 flow. Second operand 8 states and 165 transitions.
[2024-06-03 22:17:24,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 192 transitions, 2042 flow
[2024-06-03 22:17:24,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 192 transitions, 1883 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-03 22:17:24,889 INFO  L231             Difference]: Finished difference. Result has 118 places, 158 transitions, 1394 flow
[2024-06-03 22:17:24,889 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1394, PETRI_PLACES=118, PETRI_TRANSITIONS=158}
[2024-06-03 22:17:24,890 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 63 predicate places.
[2024-06-03 22:17:24,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 158 transitions, 1394 flow
[2024-06-03 22:17:24,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:17:24,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:17:24,890 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:17:24,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:17:24,891 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-03 22:17:24,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:17:24,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -144793592, now seen corresponding path program 2 times
[2024-06-03 22:17:24,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:17:24,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317740467]
[2024-06-03 22:17:24,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:17:24,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:17:24,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:17:38,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:17:38,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:17:38,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317740467]
[2024-06-03 22:17:38,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317740467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:17:38,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:17:38,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:17:38,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950880805]
[2024-06-03 22:17:38,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:17:38,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:17:38,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:17:38,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:17:38,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:17:38,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:17:38,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 158 transitions, 1394 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:17:38,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:17:38,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:17:38,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:17:46,990 INFO  L124   PetriNetUnfolderBase]: 14653/19811 cut-off events.
[2024-06-03 22:17:46,990 INFO  L125   PetriNetUnfolderBase]: For 581483/581497 co-relation queries the response was YES.
[2024-06-03 22:17:47,042 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 129373 conditions, 19811 events. 14653/19811 cut-off events. For 581483/581497 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 101793 event pairs, 5757 based on Foata normal form. 14/19817 useless extension candidates. Maximal degree in co-relation 129324. Up to 19322 conditions per place. 
[2024-06-03 22:17:47,127 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 144 selfloop transitions, 49 changer transitions 0/197 dead transitions.
[2024-06-03 22:17:47,128 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 197 transitions, 1891 flow
[2024-06-03 22:17:47,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:17:47,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:17:47,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions.
[2024-06-03 22:17:47,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44505494505494503
[2024-06-03 22:17:47,131 INFO  L175             Difference]: Start difference. First operand has 118 places, 158 transitions, 1394 flow. Second operand 7 states and 162 transitions.
[2024-06-03 22:17:47,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 197 transitions, 1891 flow
[2024-06-03 22:17:47,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 197 transitions, 1764 flow, removed 55 selfloop flow, removed 4 redundant places.
[2024-06-03 22:17:47,407 INFO  L231             Difference]: Finished difference. Result has 122 places, 161 transitions, 1410 flow
[2024-06-03 22:17:47,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1410, PETRI_PLACES=122, PETRI_TRANSITIONS=161}
[2024-06-03 22:17:47,408 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 67 predicate places.
[2024-06-03 22:17:47,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 161 transitions, 1410 flow
[2024-06-03 22:17:47,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:17:47,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:17:47,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:17:47,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:17:47,409 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:17:47,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:17:47,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 518313716, now seen corresponding path program 2 times
[2024-06-03 22:17:47,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:17:47,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106919642]
[2024-06-03 22:17:47,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:17:47,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:17:47,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:18:02,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:18:02,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:18:02,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106919642]
[2024-06-03 22:18:02,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106919642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:18:02,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:18:02,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:18:02,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372041030]
[2024-06-03 22:18:02,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:18:02,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:18:02,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:18:02,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:18:02,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:18:02,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:18:02,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 161 transitions, 1410 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:02,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:18:02,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:18:02,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:18:10,134 INFO  L124   PetriNetUnfolderBase]: 14689/19858 cut-off events.
[2024-06-03 22:18:10,135 INFO  L125   PetriNetUnfolderBase]: For 615635/615653 co-relation queries the response was YES.
[2024-06-03 22:18:10,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131611 conditions, 19858 events. 14689/19858 cut-off events. For 615635/615653 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 102071 event pairs, 5995 based on Foata normal form. 20/19874 useless extension candidates. Maximal degree in co-relation 131559. Up to 19674 conditions per place. 
[2024-06-03 22:18:10,283 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 173 selfloop transitions, 28 changer transitions 0/205 dead transitions.
[2024-06-03 22:18:10,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 205 transitions, 2004 flow
[2024-06-03 22:18:10,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:18:10,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:18:10,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions.
[2024-06-03 22:18:10,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4182692307692308
[2024-06-03 22:18:10,286 INFO  L175             Difference]: Start difference. First operand has 122 places, 161 transitions, 1410 flow. Second operand 8 states and 174 transitions.
[2024-06-03 22:18:10,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 205 transitions, 2004 flow
[2024-06-03 22:18:10,492 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 205 transitions, 1890 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-03 22:18:10,494 INFO  L231             Difference]: Finished difference. Result has 125 places, 164 transitions, 1456 flow
[2024-06-03 22:18:10,495 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=125, PETRI_TRANSITIONS=164}
[2024-06-03 22:18:10,495 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places.
[2024-06-03 22:18:10,495 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 164 transitions, 1456 flow
[2024-06-03 22:18:10,495 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:10,495 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:18:10,495 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:18:10,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:18:10,496 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:18:10,496 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:18:10,496 INFO  L85        PathProgramCache]: Analyzing trace with hash -1892167896, now seen corresponding path program 4 times
[2024-06-03 22:18:10,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:18:10,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696531504]
[2024-06-03 22:18:10,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:18:10,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:18:10,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:18:25,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:18:25,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:18:25,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696531504]
[2024-06-03 22:18:25,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696531504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:18:25,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:18:25,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:18:25,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156800126]
[2024-06-03 22:18:25,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:18:25,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:18:25,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:18:25,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:18:25,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:18:26,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:18:26,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 164 transitions, 1456 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:26,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:18:26,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:18:26,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:18:32,746 INFO  L124   PetriNetUnfolderBase]: 11990/16306 cut-off events.
[2024-06-03 22:18:32,746 INFO  L125   PetriNetUnfolderBase]: For 538224/538238 co-relation queries the response was YES.
[2024-06-03 22:18:32,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112787 conditions, 16306 events. 11990/16306 cut-off events. For 538224/538238 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 84945 event pairs, 4862 based on Foata normal form. 14/16312 useless extension candidates. Maximal degree in co-relation 112734. Up to 15990 conditions per place. 
[2024-06-03 22:18:32,857 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 158 selfloop transitions, 45 changer transitions 0/208 dead transitions.
[2024-06-03 22:18:32,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 208 transitions, 2068 flow
[2024-06-03 22:18:32,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:18:32,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:18:32,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-06-03 22:18:32,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4423076923076923
[2024-06-03 22:18:32,860 INFO  L175             Difference]: Start difference. First operand has 125 places, 164 transitions, 1456 flow. Second operand 8 states and 184 transitions.
[2024-06-03 22:18:32,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 208 transitions, 2068 flow
[2024-06-03 22:18:33,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 208 transitions, 1934 flow, removed 41 selfloop flow, removed 6 redundant places.
[2024-06-03 22:18:33,058 INFO  L231             Difference]: Finished difference. Result has 127 places, 167 transitions, 1526 flow
[2024-06-03 22:18:33,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1526, PETRI_PLACES=127, PETRI_TRANSITIONS=167}
[2024-06-03 22:18:33,059 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 72 predicate places.
[2024-06-03 22:18:33,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 167 transitions, 1526 flow
[2024-06-03 22:18:33,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:33,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:18:33,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:18:33,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:18:33,060 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:18:33,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:18:33,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -1655807838, now seen corresponding path program 3 times
[2024-06-03 22:18:33,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:18:33,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100653730]
[2024-06-03 22:18:33,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:18:33,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:18:33,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:18:46,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:18:46,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:18:46,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100653730]
[2024-06-03 22:18:46,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100653730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:18:46,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:18:46,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:18:46,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735547925]
[2024-06-03 22:18:46,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:18:46,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:18:46,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:18:46,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:18:46,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:18:47,280 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:18:47,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 167 transitions, 1526 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:47,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:18:47,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:18:47,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:18:54,735 INFO  L124   PetriNetUnfolderBase]: 14695/19873 cut-off events.
[2024-06-03 22:18:54,735 INFO  L125   PetriNetUnfolderBase]: For 687894/687908 co-relation queries the response was YES.
[2024-06-03 22:18:54,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 136562 conditions, 19873 events. 14695/19873 cut-off events. For 687894/687908 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 101980 event pairs, 5783 based on Foata normal form. 14/19879 useless extension candidates. Maximal degree in co-relation 136508. Up to 19247 conditions per place. 
[2024-06-03 22:18:54,886 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 141 selfloop transitions, 67 changer transitions 0/212 dead transitions.
[2024-06-03 22:18:54,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 212 transitions, 2150 flow
[2024-06-03 22:18:54,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:18:54,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:18:54,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions.
[2024-06-03 22:18:54,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4326923076923077
[2024-06-03 22:18:54,890 INFO  L175             Difference]: Start difference. First operand has 127 places, 167 transitions, 1526 flow. Second operand 8 states and 180 transitions.
[2024-06-03 22:18:54,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 212 transitions, 2150 flow
[2024-06-03 22:18:55,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 212 transitions, 1969 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-03 22:18:55,174 INFO  L231             Difference]: Finished difference. Result has 129 places, 170 transitions, 1593 flow
[2024-06-03 22:18:55,174 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1593, PETRI_PLACES=129, PETRI_TRANSITIONS=170}
[2024-06-03 22:18:55,175 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 74 predicate places.
[2024-06-03 22:18:55,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 170 transitions, 1593 flow
[2024-06-03 22:18:55,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:18:55,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:18:55,175 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:18:55,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:18:55,176 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:18:55,176 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:18:55,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -1655799468, now seen corresponding path program 4 times
[2024-06-03 22:18:55,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:18:55,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385834188]
[2024-06-03 22:18:55,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:18:55,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:18:55,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:19:10,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:19:10,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:19:10,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385834188]
[2024-06-03 22:19:10,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385834188] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:19:10,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:19:10,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:19:10,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062042821]
[2024-06-03 22:19:10,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:19:10,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:19:10,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:19:10,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:19:10,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:19:10,611 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:19:10,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 170 transitions, 1593 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:19:10,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:19:10,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:19:10,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:19:18,918 INFO  L124   PetriNetUnfolderBase]: 14913/20195 cut-off events.
[2024-06-03 22:19:18,919 INFO  L125   PetriNetUnfolderBase]: For 757024/757038 co-relation queries the response was YES.
[2024-06-03 22:19:18,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 142697 conditions, 20195 events. 14913/20195 cut-off events. For 757024/757038 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104502 event pairs, 5251 based on Foata normal form. 14/20201 useless extension candidates. Maximal degree in co-relation 142642. Up to 19150 conditions per place. 
[2024-06-03 22:19:19,059 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 141 selfloop transitions, 80 changer transitions 0/225 dead transitions.
[2024-06-03 22:19:19,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 225 transitions, 2511 flow
[2024-06-03 22:19:19,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:19:19,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:19:19,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions.
[2024-06-03 22:19:19,063 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4519230769230769
[2024-06-03 22:19:19,063 INFO  L175             Difference]: Start difference. First operand has 129 places, 170 transitions, 1593 flow. Second operand 8 states and 188 transitions.
[2024-06-03 22:19:19,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 225 transitions, 2511 flow
[2024-06-03 22:19:19,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 225 transitions, 2289 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-03 22:19:19,375 INFO  L231             Difference]: Finished difference. Result has 131 places, 175 transitions, 1735 flow
[2024-06-03 22:19:19,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1735, PETRI_PLACES=131, PETRI_TRANSITIONS=175}
[2024-06-03 22:19:19,376 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places.
[2024-06-03 22:19:19,376 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 175 transitions, 1735 flow
[2024-06-03 22:19:19,376 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:19:19,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:19:19,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:19:19,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:19:19,377 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-03 22:19:19,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:19:19,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -1566091326, now seen corresponding path program 2 times
[2024-06-03 22:19:19,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:19:19,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812226178]
[2024-06-03 22:19:19,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:19:19,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:19:19,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:19:43,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:19:43,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:19:43,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812226178]
[2024-06-03 22:19:43,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812226178] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:19:43,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:19:43,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:19:43,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114422723]
[2024-06-03 22:19:43,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:19:43,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:19:43,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:19:43,870 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:19:43,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:19:43,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:19:43,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 175 transitions, 1735 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:19:43,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:19:43,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:19:43,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:19:51,819 INFO  L124   PetriNetUnfolderBase]: 14906/20181 cut-off events.
[2024-06-03 22:19:51,819 INFO  L125   PetriNetUnfolderBase]: For 818760/818778 co-relation queries the response was YES.
[2024-06-03 22:19:51,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145836 conditions, 20181 events. 14906/20181 cut-off events. For 818760/818778 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104402 event pairs, 6321 based on Foata normal form. 16/20193 useless extension candidates. Maximal degree in co-relation 145780. Up to 20113 conditions per place. 
[2024-06-03 22:19:51,965 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 168 selfloop transitions, 21 changer transitions 0/193 dead transitions.
[2024-06-03 22:19:51,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 193 transitions, 2159 flow
[2024-06-03 22:19:51,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:19:51,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:19:51,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions.
[2024-06-03 22:19:51,966 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40064102564102566
[2024-06-03 22:19:51,966 INFO  L175             Difference]: Start difference. First operand has 131 places, 175 transitions, 1735 flow. Second operand 6 states and 125 transitions.
[2024-06-03 22:19:51,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 193 transitions, 2159 flow
[2024-06-03 22:19:52,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 1930 flow, removed 77 selfloop flow, removed 4 redundant places.
[2024-06-03 22:19:52,268 INFO  L231             Difference]: Finished difference. Result has 133 places, 175 transitions, 1557 flow
[2024-06-03 22:19:52,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1557, PETRI_PLACES=133, PETRI_TRANSITIONS=175}
[2024-06-03 22:19:52,269 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places.
[2024-06-03 22:19:52,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 175 transitions, 1557 flow
[2024-06-03 22:19:52,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:19:52,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:19:52,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:19:52,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:19:52,269 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-03 22:19:52,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:19:52,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -319539414, now seen corresponding path program 1 times
[2024-06-03 22:19:52,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:19:52,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391318715]
[2024-06-03 22:19:52,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:19:52,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:19:52,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:20:10,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:20:10,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:20:10,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391318715]
[2024-06-03 22:20:10,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391318715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:20:10,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:20:10,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:20:10,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924204127]
[2024-06-03 22:20:10,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:20:10,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:20:10,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:20:10,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:20:10,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:20:10,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:20:10,896 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 175 transitions, 1557 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:20:10,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:20:10,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:20:10,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:20:17,988 INFO  L124   PetriNetUnfolderBase]: 12850/18030 cut-off events.
[2024-06-03 22:20:17,988 INFO  L125   PetriNetUnfolderBase]: For 719825/719825 co-relation queries the response was YES.
[2024-06-03 22:20:18,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128958 conditions, 18030 events. 12850/18030 cut-off events. For 719825/719825 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 98922 event pairs, 5114 based on Foata normal form. 2/18030 useless extension candidates. Maximal degree in co-relation 128900. Up to 17412 conditions per place. 
[2024-06-03 22:20:18,117 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 187 selfloop transitions, 21 changer transitions 0/213 dead transitions.
[2024-06-03 22:20:18,118 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 213 transitions, 2313 flow
[2024-06-03 22:20:18,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:20:18,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:20:18,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions.
[2024-06-03 22:20:18,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175824175824176
[2024-06-03 22:20:18,119 INFO  L175             Difference]: Start difference. First operand has 133 places, 175 transitions, 1557 flow. Second operand 7 states and 152 transitions.
[2024-06-03 22:20:18,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 213 transitions, 2313 flow
[2024-06-03 22:20:18,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 213 transitions, 2271 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-03 22:20:18,417 INFO  L231             Difference]: Finished difference. Result has 136 places, 186 transitions, 1749 flow
[2024-06-03 22:20:18,418 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1749, PETRI_PLACES=136, PETRI_TRANSITIONS=186}
[2024-06-03 22:20:18,418 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 81 predicate places.
[2024-06-03 22:20:18,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 186 transitions, 1749 flow
[2024-06-03 22:20:18,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:20:18,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:20:18,419 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:20:18,419 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:20:18,419 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-03 22:20:18,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:20:18,419 INFO  L85        PathProgramCache]: Analyzing trace with hash -1566085374, now seen corresponding path program 2 times
[2024-06-03 22:20:18,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:20:18,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239026457]
[2024-06-03 22:20:18,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:20:18,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:20:18,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:20:34,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:20:34,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:20:34,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239026457]
[2024-06-03 22:20:34,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239026457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:20:34,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:20:34,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:20:34,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079305322]
[2024-06-03 22:20:34,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:20:34,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:20:34,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:20:34,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:20:34,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:20:35,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52
[2024-06-03 22:20:35,237 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 186 transitions, 1749 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:20:35,237 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:20:35,237 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52
[2024-06-03 22:20:35,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:20:42,178 INFO  L124   PetriNetUnfolderBase]: 12843/18021 cut-off events.
[2024-06-03 22:20:42,178 INFO  L125   PetriNetUnfolderBase]: For 764908/764908 co-relation queries the response was YES.
[2024-06-03 22:20:42,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 132753 conditions, 18021 events. 12843/18021 cut-off events. For 764908/764908 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 98872 event pairs, 5146 based on Foata normal form. 2/18021 useless extension candidates. Maximal degree in co-relation 132693. Up to 17429 conditions per place. 
[2024-06-03 22:20:42,306 INFO  L140   encePairwiseOnDemand]: 42/52 looper letters, 186 selfloop transitions, 14 changer transitions 0/205 dead transitions.
[2024-06-03 22:20:42,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 205 transitions, 2200 flow
[2024-06-03 22:20:42,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:20:42,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:20:42,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-03 22:20:42,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41025641025641024
[2024-06-03 22:20:42,307 INFO  L175             Difference]: Start difference. First operand has 136 places, 186 transitions, 1749 flow. Second operand 6 states and 128 transitions.
[2024-06-03 22:20:42,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 205 transitions, 2200 flow
[2024-06-03 22:20:42,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 205 transitions, 2072 flow, removed 58 selfloop flow, removed 3 redundant places.
[2024-06-03 22:20:42,659 INFO  L231             Difference]: Finished difference. Result has 139 places, 187 transitions, 1665 flow
[2024-06-03 22:20:42,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1665, PETRI_PLACES=139, PETRI_TRANSITIONS=187}
[2024-06-03 22:20:42,659 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places.
[2024-06-03 22:20:42,659 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 187 transitions, 1665 flow
[2024-06-03 22:20:42,660 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-03 22:20:42,660 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:20:42,660 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:20:42,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:20:42,660 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:20:42,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:20:42,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -511838728, now seen corresponding path program 1 times
[2024-06-03 22:20:42,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:20:42,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468043119]
[2024-06-03 22:20:42,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:20:42,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:20:42,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:20:58,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:20:58,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:20:58,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468043119]
[2024-06-03 22:20:58,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468043119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:20:58,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:20:58,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:20:58,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159882035]
[2024-06-03 22:20:58,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:20:58,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:20:58,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:20:58,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:20:58,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:20:58,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:20:58,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 187 transitions, 1665 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:20:58,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:20:58,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:20:58,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:21:06,690 INFO  L124   PetriNetUnfolderBase]: 15079/20434 cut-off events.
[2024-06-03 22:21:06,691 INFO  L125   PetriNetUnfolderBase]: For 964476/964476 co-relation queries the response was YES.
[2024-06-03 22:21:06,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154536 conditions, 20434 events. 15079/20434 cut-off events. For 964476/964476 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 105942 event pairs, 5750 based on Foata normal form. 30/20462 useless extension candidates. Maximal degree in co-relation 154474. Up to 19845 conditions per place. 
[2024-06-03 22:21:06,841 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 190 selfloop transitions, 44 changer transitions 0/238 dead transitions.
[2024-06-03 22:21:06,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 238 transitions, 2357 flow
[2024-06-03 22:21:06,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:21:06,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:21:06,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions.
[2024-06-03 22:21:06,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4423076923076923
[2024-06-03 22:21:06,844 INFO  L175             Difference]: Start difference. First operand has 139 places, 187 transitions, 1665 flow. Second operand 8 states and 184 transitions.
[2024-06-03 22:21:06,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 238 transitions, 2357 flow
[2024-06-03 22:21:07,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 238 transitions, 2326 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-03 22:21:07,182 INFO  L231             Difference]: Finished difference. Result has 143 places, 189 transitions, 1824 flow
[2024-06-03 22:21:07,182 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1824, PETRI_PLACES=143, PETRI_TRANSITIONS=189}
[2024-06-03 22:21:07,182 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 88 predicate places.
[2024-06-03 22:21:07,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 189 transitions, 1824 flow
[2024-06-03 22:21:07,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:21:07,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:21:07,182 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:21:07,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:21:07,182 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-03 22:21:07,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:21:07,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -1658751288, now seen corresponding path program 1 times
[2024-06-03 22:21:07,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:21:07,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984373203]
[2024-06-03 22:21:07,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:21:07,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:21:07,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:21:33,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:21:33,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:21:33,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984373203]
[2024-06-03 22:21:33,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984373203] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:21:33,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:21:33,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:21:33,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475128290]
[2024-06-03 22:21:33,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:21:33,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:21:33,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:21:33,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:21:33,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:21:33,619 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:21:33,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 189 transitions, 1824 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-03 22:21:33,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:21:33,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:21:33,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:21:41,942 INFO  L124   PetriNetUnfolderBase]: 15111/20476 cut-off events.
[2024-06-03 22:21:41,942 INFO  L125   PetriNetUnfolderBase]: For 996109/996109 co-relation queries the response was YES.
[2024-06-03 22:21:42,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156894 conditions, 20476 events. 15111/20476 cut-off events. For 996109/996109 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 106180 event pairs, 6152 based on Foata normal form. 4/20478 useless extension candidates. Maximal degree in co-relation 156831. Up to 20317 conditions per place. 
[2024-06-03 22:21:42,108 INFO  L140   encePairwiseOnDemand]: 41/52 looper letters, 206 selfloop transitions, 37 changer transitions 0/247 dead transitions.
[2024-06-03 22:21:42,108 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 247 transitions, 2728 flow
[2024-06-03 22:21:42,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:21:42,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:21:42,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-06-03 22:21:42,111 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-03 22:21:42,112 INFO  L175             Difference]: Start difference. First operand has 143 places, 189 transitions, 1824 flow. Second operand 10 states and 208 transitions.
[2024-06-03 22:21:42,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 247 transitions, 2728 flow
[2024-06-03 22:21:42,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 247 transitions, 2592 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-03 22:21:42,651 INFO  L231             Difference]: Finished difference. Result has 147 places, 197 transitions, 1944 flow
[2024-06-03 22:21:42,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1944, PETRI_PLACES=147, PETRI_TRANSITIONS=197}
[2024-06-03 22:21:42,651 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places.
[2024-06-03 22:21:42,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 197 transitions, 1944 flow
[2024-06-03 22:21:42,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-03 22:21:42,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:21:42,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:21:42,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:21:42,652 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:21:42,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:21:42,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227215564, now seen corresponding path program 2 times
[2024-06-03 22:21:42,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:21:42,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156615040]
[2024-06-03 22:21:42,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:21:42,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:21:42,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:21:56,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:21:56,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:21:56,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156615040]
[2024-06-03 22:21:56,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156615040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:21:56,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:21:56,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:21:56,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325446623]
[2024-06-03 22:21:56,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:21:56,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:21:56,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:21:56,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:21:56,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:21:57,150 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:21:57,150 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 197 transitions, 1944 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:21:57,150 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:21:57,150 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:21:57,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:22:05,581 INFO  L124   PetriNetUnfolderBase]: 15275/20720 cut-off events.
[2024-06-03 22:22:05,581 INFO  L125   PetriNetUnfolderBase]: For 1075712/1075712 co-relation queries the response was YES.
[2024-06-03 22:22:05,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162159 conditions, 20720 events. 15275/20720 cut-off events. For 1075712/1075712 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 107686 event pairs, 5745 based on Foata normal form. 30/20748 useless extension candidates. Maximal degree in co-relation 162095. Up to 20055 conditions per place. 
[2024-06-03 22:22:05,740 INFO  L140   encePairwiseOnDemand]: 39/52 looper letters, 200 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2024-06-03 22:22:05,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 250 transitions, 2678 flow
[2024-06-03 22:22:05,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:22:05,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:22:05,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions.
[2024-06-03 22:22:05,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4495192307692308
[2024-06-03 22:22:05,743 INFO  L175             Difference]: Start difference. First operand has 147 places, 197 transitions, 1944 flow. Second operand 8 states and 187 transitions.
[2024-06-03 22:22:05,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 250 transitions, 2678 flow
[2024-06-03 22:22:06,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 250 transitions, 2549 flow, removed 47 selfloop flow, removed 6 redundant places.
[2024-06-03 22:22:06,251 INFO  L231             Difference]: Finished difference. Result has 149 places, 199 transitions, 2017 flow
[2024-06-03 22:22:06,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2017, PETRI_PLACES=149, PETRI_TRANSITIONS=199}
[2024-06-03 22:22:06,251 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places.
[2024-06-03 22:22:06,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 199 transitions, 2017 flow
[2024-06-03 22:22:06,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:22:06,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:22:06,252 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:22:06,252 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:22:06,252 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:22:06,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:22:06,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227208124, now seen corresponding path program 3 times
[2024-06-03 22:22:06,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:22:06,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969499608]
[2024-06-03 22:22:06,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:22:06,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:22:06,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:22:20,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:22:20,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:22:20,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969499608]
[2024-06-03 22:22:20,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969499608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:22:20,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:22:20,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:22:20,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948754421]
[2024-06-03 22:22:20,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:22:20,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:22:20,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:22:20,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:22:20,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:22:20,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:22:20,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 199 transitions, 2017 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:22:20,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:22:20,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:22:20,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:22:29,746 INFO  L124   PetriNetUnfolderBase]: 15534/21109 cut-off events.
[2024-06-03 22:22:29,747 INFO  L125   PetriNetUnfolderBase]: For 1172150/1172150 co-relation queries the response was YES.
[2024-06-03 22:22:29,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169101 conditions, 21109 events. 15534/21109 cut-off events. For 1172150/1172150 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 110439 event pairs, 5785 based on Foata normal form. 24/21131 useless extension candidates. Maximal degree in co-relation 169035. Up to 19803 conditions per place. 
[2024-06-03 22:22:29,919 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 202 selfloop transitions, 53 changer transitions 0/259 dead transitions.
[2024-06-03 22:22:29,919 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 259 transitions, 3069 flow
[2024-06-03 22:22:29,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:22:29,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:22:29,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions.
[2024-06-03 22:22:29,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4567307692307692
[2024-06-03 22:22:29,922 INFO  L175             Difference]: Start difference. First operand has 149 places, 199 transitions, 2017 flow. Second operand 8 states and 190 transitions.
[2024-06-03 22:22:29,922 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 259 transitions, 3069 flow
[2024-06-03 22:22:30,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 259 transitions, 2921 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-03 22:22:30,559 INFO  L231             Difference]: Finished difference. Result has 151 places, 203 transitions, 2180 flow
[2024-06-03 22:22:30,559 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2180, PETRI_PLACES=151, PETRI_TRANSITIONS=203}
[2024-06-03 22:22:30,559 INFO  L281   CegarLoopForPetriNet]: 55 programPoint places, 96 predicate places.
[2024-06-03 22:22:30,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 203 transitions, 2180 flow
[2024-06-03 22:22:30,559 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:22:30,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:22:30,560 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:22:30,560 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:22:30,560 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-03 22:22:30,560 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:22:30,560 INFO  L85        PathProgramCache]: Analyzing trace with hash -1159497052, now seen corresponding path program 1 times
[2024-06-03 22:22:30,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:22:30,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971682756]
[2024-06-03 22:22:30,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:22:30,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:22:30,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:22:56,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:22:56,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:22:56,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971682756]
[2024-06-03 22:22:56,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971682756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:22:56,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:22:56,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:22:56,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889381927]
[2024-06-03 22:22:56,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:22:56,268 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:22:56,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:22:56,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:22:56,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:22:56,484 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52
[2024-06-03 22:22:56,485 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 203 transitions, 2180 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-03 22:22:56,485 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:22:56,485 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52
[2024-06-03 22:22:56,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:23:04,978 INFO  L124   PetriNetUnfolderBase]: 15619/21219 cut-off events.
[2024-06-03 22:23:04,978 INFO  L125   PetriNetUnfolderBase]: For 1203925/1203925 co-relation queries the response was YES.
[2024-06-03 22:23:05,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171860 conditions, 21219 events. 15619/21219 cut-off events. For 1203925/1203925 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 111037 event pairs, 6193 based on Foata normal form. 6/21223 useless extension candidates. Maximal degree in co-relation 171793. Up to 20986 conditions per place. 
[2024-06-03 22:23:05,158 INFO  L140   encePairwiseOnDemand]: 40/52 looper letters, 233 selfloop transitions, 44 changer transitions 0/281 dead transitions.
[2024-06-03 22:23:05,159 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 281 transitions, 3732 flow
[2024-06-03 22:23:05,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:23:05,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:23:05,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions.
[2024-06-03 22:23:05,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4252136752136752
[2024-06-03 22:23:05,160 INFO  L175             Difference]: Start difference. First operand has 151 places, 203 transitions, 2180 flow. Second operand 9 states and 199 transitions.
[2024-06-03 22:23:05,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 281 transitions, 3732 flow
Killed by 15