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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix051_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-76401ed-m
[2024-06-20 19:16:21,412 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:16:21,478 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:16:21,481 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:16:21,482 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:16:21,527 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:16:21,527 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:16:21,528 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:16:21,528 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:16:21,531 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:16:21,531 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:16:21,532 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:16:21,532 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:16:21,533 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:16:21,534 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:16:21,534 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:16:21,534 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:16:21,534 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:16:21,534 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:16:21,534 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:16:21,535 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:16:21,536 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:16:21,537 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:16:21,537 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:16:21,537 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:16:21,538 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:16:21,538 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:16:21,538 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:16:21,538 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:16:21,538 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:16:21,539 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:16:21,540 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:16:21,737 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:16:21,754 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:16:21,757 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:16:21,758 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:16:21,758 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:16:21,759 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i
[2024-06-20 19:16:22,792 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:16:23,045 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:16:23,048 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i
[2024-06-20 19:16:23,065 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c389f86/d95949bad88043028e7f5d85614161fb/FLAG4185dcdef
[2024-06-20 19:16:23,077 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c389f86/d95949bad88043028e7f5d85614161fb
[2024-06-20 19:16:23,078 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:16:23,079 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:16:23,081 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/mix051_tso.oepc.yml/witness.yml
[2024-06-20 19:16:23,305 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:16:23,306 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:16:23,307 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:16:23,308 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:16:23,311 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:16:23,312 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:23" (1/2) ...
[2024-06-20 19:16:23,312 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6303edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:23, skipping insertion in model container
[2024-06-20 19:16:23,312 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:23" (1/2) ...
[2024-06-20 19:16:23,314 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@586c6e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:23, skipping insertion in model container
[2024-06-20 19:16:23,314 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:23" (2/2) ...
[2024-06-20 19:16:23,314 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6303edb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:23, skipping insertion in model container
[2024-06-20 19:16:23,315 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:23" (2/2) ...
[2024-06-20 19:16:23,315 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:16:23,479 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:16:23,480 INFO  L97    edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:23,481 INFO  L97    edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:23,482 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:23,482 INFO  L97    edCorrectnessWitness]: Location invariant before [L853-L853] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:23,483 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:16:23,484 INFO  L106   edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1;
[2024-06-20 19:16:23,521 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:16:23,826 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:16:23,840 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:16:24,297 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:16:24,328 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:16:24,329 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:24 WrapperNode
[2024-06-20 19:16:24,329 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:16:24,330 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:16:24,330 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:16:24,330 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:16:24,334 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 20.06 07:16:24" (1/1) ...
[2024-06-20 19:16:24,382 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 20.06 07:16:24" (1/1) ...
[2024-06-20 19:16:24,428 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner has thrown an exception:
java.lang.StackOverflowError
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
	at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.BoogieCopyTransformer.processExpression(BoogieCopyTransformer.java:175)
[2024-06-20 19:16:24,447 INFO  L158              Benchmark]: Toolchain (without parser) took 1139.67ms. Allocated memory is still 207.6MB. Free memory was 114.5MB in the beginning and 124.7MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-06-20 19:16:24,447 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-06-20 19:16:24,448 INFO  L158              Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-06-20 19:16:24,448 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1021.58ms. Allocated memory is still 207.6MB. Free memory was 114.2MB in the beginning and 145.7MB in the end (delta: -31.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB.
[2024-06-20 19:16:24,449 INFO  L158              Benchmark]: Boogie Procedure Inliner took 115.86ms. Allocated memory is still 207.6MB. Free memory was 145.7MB in the beginning and 124.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-06-20 19:16:24,451 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * Witness Parser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 1021.58ms. Allocated memory is still 207.6MB. Free memory was 114.2MB in the beginning and 145.7MB in the end (delta: -31.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 115.86ms. Allocated memory is still 207.6MB. Free memory was 145.7MB in the beginning and 124.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.boogie.procedureinliner:
  - ExceptionOrErrorResult: StackOverflowError: null
    de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: StackOverflowError: null: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.InlineVersionTransformer.processExpression(InlineVersionTransformer.java:1240)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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/mix051_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix051_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:16:26,207 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:16:26,266 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-06-20 19:16:26,275 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:16:26,276 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:16:26,310 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:16:26,310 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:16:26,311 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:16:26,311 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:16:26,315 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:16:26,315 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:16:26,315 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:16:26,315 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:16:26,317 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:16:26,317 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:16:26,317 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:16:26,317 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:16:26,318 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:16:26,318 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:16:26,318 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:16:26,318 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:16:26,319 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:16:26,319 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:16:26,319 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-06-20 19:16:26,320 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-06-20 19:16:26,320 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:16:26,320 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-06-20 19:16:26,320 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:16:26,320 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:16:26,321 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:16:26,322 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:16:26,322 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:16:26,322 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:16:26,322 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:16:26,322 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:16:26,323 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:16:26,323 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:16:26,323 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:16:26,324 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:16:26,325 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:16:26,325 INFO  L153        SettingsManager]:  * Logic for external solver=AUFBV
[2024-06-20 19:16:26,325 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:16:26,582 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:16:26,606 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:16:26,608 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:16:26,610 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:16:26,610 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:16:26,612 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i
[2024-06-20 19:16:27,693 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:16:27,915 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:16:27,915 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i
[2024-06-20 19:16:27,927 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72f03175/82b28b8ca91540dea3953ae6941fdafa/FLAG22b11d7f1
[2024-06-20 19:16:27,938 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72f03175/82b28b8ca91540dea3953ae6941fdafa
[2024-06-20 19:16:27,940 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:16:27,940 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:16:27,942 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/mix051_tso.oepc.yml/witness.yml
[2024-06-20 19:16:28,161 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:16:28,162 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:16:28,164 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:16:28,164 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:16:28,168 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:16:28,168 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:27" (1/2) ...
[2024-06-20 19:16:28,169 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57326131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:28, skipping insertion in model container
[2024-06-20 19:16:28,169 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:27" (1/2) ...
[2024-06-20 19:16:28,170 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@467f8dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:28, skipping insertion in model container
[2024-06-20 19:16:28,170 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:28" (2/2) ...
[2024-06-20 19:16:28,171 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57326131 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:28, skipping insertion in model container
[2024-06-20 19:16:28,171 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:28" (2/2) ...
[2024-06-20 19:16:28,171 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:16:28,282 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:16:28,283 INFO  L97    edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:28,284 INFO  L97    edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:28,285 INFO  L97    edCorrectnessWitness]: Location invariant before [L853-L853] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:28,285 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd4 == (_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_p2_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_p2_EAX >= 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_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_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_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_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 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_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_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 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_p2_EAX == 0 || __unbuffered_p2_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)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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 <= 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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-20 19:16:28,286 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:16:28,287 INFO  L106   edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1;
[2024-06-20 19:16:28,329 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:16:28,627 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:16:28,638 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:16:29,018 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:16:29,094 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:16:29,095 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29 WrapperNode
[2024-06-20 19:16:29,095 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:16:29,096 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:16:29,096 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:16:29,096 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:16:29,101 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 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,139 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 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,211 INFO  L138                Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158
[2024-06-20 19:16:29,211 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:16:29,213 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:16:29,213 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:16:29,213 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:16:29,222 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,222 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,251 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,311 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:16:29,311 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,312 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,455 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,457 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,489 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,494 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,516 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:16:29,517 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:16:29,517 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:16:29,517 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:16:29,519 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (1/1) ...
[2024-06-20 19:16:29,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:16:29,530 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:16:29,545 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:16:29,575 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:16:29,585 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:16:29,586 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:16:29,586 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-06-20 19:16:29,586 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:16:29,586 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:16:29,586 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:16:29,587 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:16:29,587 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:16:29,587 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:16:29,587 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-20 19:16:29,588 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-20 19:16:29,588 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:16:29,588 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:16:29,589 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:16:29,590 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:16:29,772 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:16:29,774 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:16:36,966 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:16:36,967 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:16:37,278 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:16:37,278 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:16:37,278 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:16:37 BoogieIcfgContainer
[2024-06-20 19:16:37,279 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:16:37,280 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:16:37,280 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:16:37,283 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:16:37,283 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:16:27" (1/4) ...
[2024-06-20 19:16:37,283 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22827c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:16:37, skipping insertion in model container
[2024-06-20 19:16:37,283 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:28" (2/4) ...
[2024-06-20 19:16:37,284 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22827c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:16:37, skipping insertion in model container
[2024-06-20 19:16:37,284 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:29" (3/4) ...
[2024-06-20 19:16:37,284 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22827c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:16:37, skipping insertion in model container
[2024-06-20 19:16:37,284 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:16:37" (4/4) ...
[2024-06-20 19:16:37,285 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i
[2024-06-20 19:16:37,298 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:16:37,299 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-20 19:16:37,299 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:16:37,410 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:16:37,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:16:37,570 INFO  L124   PetriNetUnfolderBase]: 0/47 cut-off events.
[2024-06-20 19:16:37,570 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:16:37,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:16:37,573 INFO  L82        GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:16:37,577 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow
[2024-06-20 19:16:37,587 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:16:37,593 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;@4a6fe228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:16:37,593 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-20 19:16:37,605 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:16:37,605 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:16:37,605 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:16:37,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:37,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:16:37,606 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:16:37,611 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:37,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 402110645, now seen corresponding path program 1 times
[2024-06-20 19:16:37,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:16:37,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080588457]
[2024-06-20 19:16:37,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:37,622 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:16:37,623 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:16:37,625 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:16:37,662 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-06-20 19:16:38,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:38,548 INFO  L262         TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-06-20 19:16:38,559 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:16:41,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:16:41,219 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:16:41,220 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:16:41,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080588457]
[2024-06-20 19:16:41,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080588457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:41,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:41,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:16:41,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442933723]
[2024-06-20 19:16:41,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:41,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:16:41,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:16:41,250 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:16:41,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:16:43,093 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:16:43,095 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:43,095 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:43,095 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:16:43,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:57,551 INFO  L124   PetriNetUnfolderBase]: 8192/11588 cut-off events.
[2024-06-20 19:16:57,551 INFO  L125   PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES.
[2024-06-20 19:16:57,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23151 conditions, 11588 events. 8192/11588 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 63972 event pairs, 6310 based on Foata normal form. 1/11373 useless extension candidates. Maximal degree in co-relation 23138. Up to 11172 conditions per place. 
[2024-06-20 19:16:57,603 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 42 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2024-06-20 19:16:57,603 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 225 flow
[2024-06-20 19:16:57,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:16:57,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:16:57,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions.
[2024-06-20 19:16:57,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6078431372549019
[2024-06-20 19:16:57,614 INFO  L175             Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 93 transitions.
[2024-06-20 19:16:57,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 225 flow
[2024-06-20 19:16:57,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:16:57,618 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 129 flow
[2024-06-20 19:16:57,633 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-20 19:16:57,637 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places.
[2024-06-20 19:16:57,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 129 flow
[2024-06-20 19:16:57,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:57,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:57,638 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:16:57,656 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2024-06-20 19:16:57,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:16:57,838 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:16:57,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:57,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -118677036, now seen corresponding path program 1 times
[2024-06-20 19:16:57,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:16:57,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268248081]
[2024-06-20 19:16:57,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:57,840 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:16:57,840 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:16:57,842 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:16:57,842 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-06-20 19:16:58,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:58,798 WARN  L260         TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-06-20 19:16:58,805 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:17:03,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:03,555 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:17:03,555 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:17:03,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268248081]
[2024-06-20 19:17:03,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [268248081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:03,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:03,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:17:03,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485655653]
[2024-06-20 19:17:03,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:03,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:17:03,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:17:03,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:17:03,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:17:07,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:17:07,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 129 flow. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:07,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:07,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:17:07,956 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:21,142 INFO  L124   PetriNetUnfolderBase]: 9577/13187 cut-off events.
[2024-06-20 19:17:21,142 INFO  L125   PetriNetUnfolderBase]: For 2471/2471 co-relation queries the response was YES.
[2024-06-20 19:17:21,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30036 conditions, 13187 events. 9577/13187 cut-off events. For 2471/2471 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70014 event pairs, 6775 based on Foata normal form. 4/13158 useless extension candidates. Maximal degree in co-relation 30024. Up to 12982 conditions per place. 
[2024-06-20 19:17:21,202 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2024-06-20 19:17:21,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 319 flow
[2024-06-20 19:17:21,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:17:21,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:17:21,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions.
[2024-06-20 19:17:21,205 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5784313725490197
[2024-06-20 19:17:21,205 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 129 flow. Second operand 4 states and 118 transitions.
[2024-06-20 19:17:21,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 319 flow
[2024-06-20 19:17:21,206 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:17:21,207 INFO  L231             Difference]: Finished difference. Result has 56 places, 49 transitions, 177 flow
[2024-06-20 19:17:21,207 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=49}
[2024-06-20 19:17:21,208 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places.
[2024-06-20 19:17:21,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 177 flow
[2024-06-20 19:17:21,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:21,208 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:21,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:21,232 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-06-20 19:17:21,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:17:21,423 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:17:21,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:21,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 615980796, now seen corresponding path program 1 times
[2024-06-20 19:17:21,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:17:21,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502168230]
[2024-06-20 19:17:21,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:21,425 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:17:21,425 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:17:21,426 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:17:21,428 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-06-20 19:17:22,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:22,297 WARN  L260         TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-06-20 19:17:22,303 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:17:28,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:28,174 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:17:28,174 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:17:28,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502168230]
[2024-06-20 19:17:28,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [502168230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:28,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:28,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:17:28,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248248882]
[2024-06-20 19:17:28,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:28,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:17:28,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:17:28,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:17:28,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:17:31,686 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:17:31,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 177 flow. Second operand  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:31,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:31,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:17:31,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:46,905 INFO  L124   PetriNetUnfolderBase]: 9557/13165 cut-off events.
[2024-06-20 19:17:46,905 INFO  L125   PetriNetUnfolderBase]: For 7067/7067 co-relation queries the response was YES.
[2024-06-20 19:17:46,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33389 conditions, 13165 events. 9557/13165 cut-off events. For 7067/7067 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70075 event pairs, 5407 based on Foata normal form. 8/13140 useless extension candidates. Maximal degree in co-relation 33375. Up to 12912 conditions per place. 
[2024-06-20 19:17:46,958 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 64 selfloop transitions, 13 changer transitions 0/84 dead transitions.
[2024-06-20 19:17:46,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 431 flow
[2024-06-20 19:17:46,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:17:46,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:17:46,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions.
[2024-06-20 19:17:46,964 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5725490196078431
[2024-06-20 19:17:46,964 INFO  L175             Difference]: Start difference. First operand has 56 places, 49 transitions, 177 flow. Second operand 5 states and 146 transitions.
[2024-06-20 19:17:46,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 431 flow
[2024-06-20 19:17:46,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-20 19:17:46,969 INFO  L231             Difference]: Finished difference. Result has 59 places, 53 transitions, 225 flow
[2024-06-20 19:17:46,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=59, PETRI_TRANSITIONS=53}
[2024-06-20 19:17:46,971 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places.
[2024-06-20 19:17:46,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 225 flow
[2024-06-20 19:17:46,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:46,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:46,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:46,987 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-06-20 19:17:47,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:17:47,185 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:17:47,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:47,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 109796081, now seen corresponding path program 1 times
[2024-06-20 19:17:47,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:17:47,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048475019]
[2024-06-20 19:17:47,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:47,186 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:17:47,186 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:17:47,189 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:17:47,190 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-06-20 19:17:47,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:47,947 WARN  L260         TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-06-20 19:17:47,953 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:17:57,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:57,406 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:17:57,406 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:17:57,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048475019]
[2024-06-20 19:17:57,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048475019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:57,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:57,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:17:57,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23724073]
[2024-06-20 19:17:57,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:57,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:17:57,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:17:57,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:17:57,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:18:00,810 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:18:00,810 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 225 flow. Second operand  has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:00,810 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:00,810 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:18:00,811 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:22,886 INFO  L124   PetriNetUnfolderBase]: 9541/13143 cut-off events.
[2024-06-20 19:18:22,886 INFO  L125   PetriNetUnfolderBase]: For 13690/13690 co-relation queries the response was YES.
[2024-06-20 19:18:22,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36701 conditions, 13143 events. 9541/13143 cut-off events. For 13690/13690 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 69906 event pairs, 4602 based on Foata normal form. 8/13118 useless extension candidates. Maximal degree in co-relation 36686. Up to 12846 conditions per place. 
[2024-06-20 19:18:22,939 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 71 selfloop transitions, 16 changer transitions 0/94 dead transitions.
[2024-06-20 19:18:22,939 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 515 flow
[2024-06-20 19:18:23,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:18:23,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:18:23,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions.
[2024-06-20 19:18:23,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5522875816993464
[2024-06-20 19:18:23,034 INFO  L175             Difference]: Start difference. First operand has 59 places, 53 transitions, 225 flow. Second operand 6 states and 169 transitions.
[2024-06-20 19:18:23,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 515 flow
[2024-06-20 19:18:23,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 482 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-20 19:18:23,038 INFO  L231             Difference]: Finished difference. Result has 61 places, 55 transitions, 256 flow
[2024-06-20 19:18:23,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=61, PETRI_TRANSITIONS=55}
[2024-06-20 19:18:23,039 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places.
[2024-06-20 19:18:23,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 256 flow
[2024-06-20 19:18:23,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:23,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:23,039 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:23,064 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-06-20 19:18:23,240 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:18:23,240 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:18:23,240 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:23,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -1784910867, now seen corresponding path program 1 times
[2024-06-20 19:18:23,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:18:23,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191747521]
[2024-06-20 19:18:23,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:23,241 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:18:23,241 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:18:23,246 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:18:23,250 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-06-20 19:18:24,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:24,799 INFO  L262         TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-06-20 19:18:24,805 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:18:29,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:29,297 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:18:29,297 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:18:29,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191747521]
[2024-06-20 19:18:29,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [191747521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:29,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:29,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:18:29,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410675388]
[2024-06-20 19:18:29,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:29,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:18:29,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:18:29,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:18:29,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:18:31,420 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-06-20 19:18:34,866 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:18:34,866 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 256 flow. Second operand  has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:34,866 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:34,866 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:18:34,866 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:47,322 INFO  L124   PetriNetUnfolderBase]: 8137/11567 cut-off events.
[2024-06-20 19:18:47,323 INFO  L125   PetriNetUnfolderBase]: For 18131/18131 co-relation queries the response was YES.
[2024-06-20 19:18:47,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34438 conditions, 11567 events. 8137/11567 cut-off events. For 18131/18131 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 64139 event pairs, 4690 based on Foata normal form. 3/11567 useless extension candidates. Maximal degree in co-relation 34422. Up to 11079 conditions per place. 
[2024-06-20 19:18:47,367 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 59 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2024-06-20 19:18:47,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 462 flow
[2024-06-20 19:18:47,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:18:47,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:18:47,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions.
[2024-06-20 19:18:47,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5686274509803921
[2024-06-20 19:18:47,369 INFO  L175             Difference]: Start difference. First operand has 61 places, 55 transitions, 256 flow. Second operand 4 states and 116 transitions.
[2024-06-20 19:18:47,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 462 flow
[2024-06-20 19:18:47,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 416 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:18:47,373 INFO  L231             Difference]: Finished difference. Result has 61 places, 59 transitions, 273 flow
[2024-06-20 19:18:47,373 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=61, PETRI_TRANSITIONS=59}
[2024-06-20 19:18:47,374 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places.
[2024-06-20 19:18:47,374 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 273 flow
[2024-06-20 19:18:47,374 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:47,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:47,375 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:47,397 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-06-20 19:18:47,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:18:47,588 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:18:47,589 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:47,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -1585229504, now seen corresponding path program 1 times
[2024-06-20 19:18:47,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:18:47,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931185738]
[2024-06-20 19:18:47,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:47,590 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:18:47,590 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:18:47,593 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:18:47,594 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-06-20 19:18:49,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:49,274 INFO  L262         TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-06-20 19:18:49,280 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:18:56,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:56,121 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:18:56,121 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:18:56,121 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931185738]
[2024-06-20 19:18:56,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931185738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:56,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:56,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:18:56,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542911951]
[2024-06-20 19:18:56,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:56,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:18:56,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:18:56,122 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:18:56,122 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:19:00,719 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:19:00,719 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 273 flow. Second operand  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:00,719 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:00,719 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:19:00,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:15,979 INFO  L124   PetriNetUnfolderBase]: 9554/13191 cut-off events.
[2024-06-20 19:19:15,980 INFO  L125   PetriNetUnfolderBase]: For 30986/30986 co-relation queries the response was YES.
[2024-06-20 19:19:15,995 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42728 conditions, 13191 events. 9554/13191 cut-off events. For 30986/30986 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70289 event pairs, 5494 based on Foata normal form. 3/13191 useless extension candidates. Maximal degree in co-relation 42711. Up to 12933 conditions per place. 
[2024-06-20 19:19:16,037 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 70 selfloop transitions, 13 changer transitions 0/90 dead transitions.
[2024-06-20 19:19:16,038 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 541 flow
[2024-06-20 19:19:16,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:19:16,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:19:16,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions.
[2024-06-20 19:19:16,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5490196078431373
[2024-06-20 19:19:16,045 INFO  L175             Difference]: Start difference. First operand has 61 places, 59 transitions, 273 flow. Second operand 5 states and 140 transitions.
[2024-06-20 19:19:16,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 541 flow
[2024-06-20 19:19:16,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 510 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-20 19:19:16,056 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 319 flow
[2024-06-20 19:19:16,056 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=64, PETRI_TRANSITIONS=63}
[2024-06-20 19:19:16,059 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places.
[2024-06-20 19:19:16,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 319 flow
[2024-06-20 19:19:16,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:16,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:16,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:19:16,086 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2024-06-20 19:19:16,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:19:16,283 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:19:16,283 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:16,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -1607365364, now seen corresponding path program 2 times
[2024-06-20 19:19:16,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:19:16,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014160645]
[2024-06-20 19:19:16,285 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-06-20 19:19:16,285 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:19:16,285 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:19:16,287 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:19:16,287 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-06-20 19:19:17,956 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-06-20 19:19:17,956 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:19:18,029 INFO  L262         TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-06-20 19:19:18,035 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:19:25,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:19:25,659 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:19:25,659 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:19:25,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014160645]
[2024-06-20 19:19:25,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014160645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:25,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:25,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:19:25,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139357709]
[2024-06-20 19:19:25,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:25,660 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:19:25,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:19:25,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:19:25,661 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:19:29,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:19:29,734 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 319 flow. Second operand  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:29,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:29,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:19:29,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:43,571 INFO  L124   PetriNetUnfolderBase]: 9545/13200 cut-off events.
[2024-06-20 19:19:43,572 INFO  L125   PetriNetUnfolderBase]: For 41908/41924 co-relation queries the response was YES.
[2024-06-20 19:19:43,586 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46030 conditions, 13200 events. 9545/13200 cut-off events. For 41908/41924 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70537 event pairs, 5476 based on Foata normal form. 15/13210 useless extension candidates. Maximal degree in co-relation 46012. Up to 12891 conditions per place. 
[2024-06-20 19:19:43,623 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 64 selfloop transitions, 20 changer transitions 0/91 dead transitions.
[2024-06-20 19:19:43,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 589 flow
[2024-06-20 19:19:43,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:19:43,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:19:43,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions.
[2024-06-20 19:19:43,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5450980392156862
[2024-06-20 19:19:43,625 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 319 flow. Second operand 5 states and 139 transitions.
[2024-06-20 19:19:43,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 589 flow
[2024-06-20 19:19:43,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 544 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-20 19:19:43,631 INFO  L231             Difference]: Finished difference. Result has 66 places, 67 transitions, 373 flow
[2024-06-20 19:19:43,632 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=67}
[2024-06-20 19:19:43,632 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2024-06-20 19:19:43,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 373 flow
[2024-06-20 19:19:43,632 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:43,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:43,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:19:43,656 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2024-06-20 19:19:43,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:19:43,852 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:19:43,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:43,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -1607357428, now seen corresponding path program 1 times
[2024-06-20 19:19:43,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:19:43,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514797608]
[2024-06-20 19:19:43,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:43,854 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:19:43,854 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:19:43,855 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:19:43,857 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-06-20 19:19:45,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:45,603 INFO  L262         TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-06-20 19:19:45,609 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:19:51,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:19:51,854 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:19:51,854 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:19:51,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514797608]
[2024-06-20 19:19:51,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514797608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:51,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:51,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:19:51,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287064890]
[2024-06-20 19:19:51,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:51,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:19:51,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:19:51,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:19:51,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:19:59,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:19:59,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 373 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:59,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:59,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:19:59,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:16,585 INFO  L124   PetriNetUnfolderBase]: 9900/13960 cut-off events.
[2024-06-20 19:20:16,585 INFO  L125   PetriNetUnfolderBase]: For 54652/54652 co-relation queries the response was YES.
[2024-06-20 19:20:16,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51103 conditions, 13960 events. 9900/13960 cut-off events. For 54652/54652 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 77110 event pairs, 5554 based on Foata normal form. 3/13960 useless extension candidates. Maximal degree in co-relation 51084. Up to 13410 conditions per place. 
[2024-06-20 19:20:16,649 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 82 selfloop transitions, 17 changer transitions 0/106 dead transitions.
[2024-06-20 19:20:16,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 712 flow
[2024-06-20 19:20:16,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:20:16,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:20:16,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions.
[2024-06-20 19:20:16,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5261437908496732
[2024-06-20 19:20:16,651 INFO  L175             Difference]: Start difference. First operand has 66 places, 67 transitions, 373 flow. Second operand 6 states and 161 transitions.
[2024-06-20 19:20:16,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 712 flow
[2024-06-20 19:20:16,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 640 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-20 19:20:16,663 INFO  L231             Difference]: Finished difference. Result has 70 places, 75 transitions, 422 flow
[2024-06-20 19:20:16,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=70, PETRI_TRANSITIONS=75}
[2024-06-20 19:20:16,665 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2024-06-20 19:20:16,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 422 flow
[2024-06-20 19:20:16,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:16,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:16,666 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:16,690 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-06-20 19:20:16,870 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:20:16,870 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-20 19:20:16,871 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:16,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -1202376372, now seen corresponding path program 1 times
[2024-06-20 19:20:16,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:20:16,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720939432]
[2024-06-20 19:20:16,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:16,872 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:20:16,872 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:20:16,873 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:20:16,894 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-06-20 19:20:18,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:18,619 INFO  L262         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-06-20 19:20:18,625 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:20:26,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:20:26,453 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:20:26,453 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:20:26,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720939432]
[2024-06-20 19:20:26,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [720939432] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:26,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:26,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:20:26,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331141723]
[2024-06-20 19:20:26,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:26,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:20:26,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:20:26,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:20:26,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:20:32,687 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:20:32,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 422 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:32,688 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:32,688 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:20:32,688 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:53,380 INFO  L124   PetriNetUnfolderBase]: 11444/15750 cut-off events.
[2024-06-20 19:20:53,380 INFO  L125   PetriNetUnfolderBase]: For 84403/84419 co-relation queries the response was YES.
[2024-06-20 19:20:53,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63347 conditions, 15750 events. 11444/15750 cut-off events. For 84403/84419 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 85196 event pairs, 5491 based on Foata normal form. 6/15748 useless extension candidates. Maximal degree in co-relation 63326. Up to 15407 conditions per place. 
[2024-06-20 19:20:53,454 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 92 selfloop transitions, 21 changer transitions 0/121 dead transitions.
[2024-06-20 19:20:53,454 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 121 transitions, 808 flow
[2024-06-20 19:20:53,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:20:53,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:20:53,544 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions.
[2024-06-20 19:20:53,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5522875816993464
[2024-06-20 19:20:53,545 INFO  L175             Difference]: Start difference. First operand has 70 places, 75 transitions, 422 flow. Second operand 6 states and 169 transitions.
[2024-06-20 19:20:53,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 121 transitions, 808 flow
[2024-06-20 19:20:53,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 749 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-20 19:20:53,558 INFO  L231             Difference]: Finished difference. Result has 74 places, 83 transitions, 493 flow
[2024-06-20 19:20:53,558 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=74, PETRI_TRANSITIONS=83}
[2024-06-20 19:20:53,559 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places.
[2024-06-20 19:20:53,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 493 flow
[2024-06-20 19:20:53,560 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:53,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:53,560 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:53,602 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2024-06-20 19:20:53,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:20:53,784 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-20 19:20:53,785 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:53,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 678843990, now seen corresponding path program 2 times
[2024-06-20 19:20:53,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:20:53,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670696272]
[2024-06-20 19:20:53,786 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-06-20 19:20:53,786 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:20:53,786 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:20:53,789 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:20:53,793 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-06-20 19:20:55,477 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-06-20 19:20:55,478 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:20:55,550 INFO  L262         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-06-20 19:20:55,556 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:21:03,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:21:03,331 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:21:03,331 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:21:03,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670696272]
[2024-06-20 19:21:03,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [670696272] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:03,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:03,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:21:03,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991074584]
[2024-06-20 19:21:03,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:03,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:21:03,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:21:03,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:21:03,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:21:06,919 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:21:06,919 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 493 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:06,919 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:06,919 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:21:06,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:25,948 INFO  L124   PetriNetUnfolderBase]: 11600/15944 cut-off events.
[2024-06-20 19:21:25,949 INFO  L125   PetriNetUnfolderBase]: For 109189/109205 co-relation queries the response was YES.
[2024-06-20 19:21:25,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69617 conditions, 15944 events. 11600/15944 cut-off events. For 109189/109205 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 86196 event pairs, 5423 based on Foata normal form. 28/15969 useless extension candidates. Maximal degree in co-relation 69594. Up to 15434 conditions per place. 
[2024-06-20 19:21:26,034 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 94 selfloop transitions, 31 changer transitions 0/133 dead transitions.
[2024-06-20 19:21:26,035 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 1027 flow
[2024-06-20 19:21:26,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:21:26,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:21:26,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions.
[2024-06-20 19:21:26,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5686274509803921
[2024-06-20 19:21:26,125 INFO  L175             Difference]: Start difference. First operand has 74 places, 83 transitions, 493 flow. Second operand 6 states and 174 transitions.
[2024-06-20 19:21:26,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 1027 flow
[2024-06-20 19:21:26,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 965 flow, removed 20 selfloop flow, removed 2 redundant places.
[2024-06-20 19:21:26,145 INFO  L231             Difference]: Finished difference. Result has 79 places, 93 transitions, 651 flow
[2024-06-20 19:21:26,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=651, PETRI_PLACES=79, PETRI_TRANSITIONS=93}
[2024-06-20 19:21:26,146 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places.
[2024-06-20 19:21:26,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 651 flow
[2024-06-20 19:21:26,147 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:26,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:26,147 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:26,173 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2024-06-20 19:21:26,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:21:26,371 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:21:26,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:26,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 855975510, now seen corresponding path program 3 times
[2024-06-20 19:21:26,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:21:26,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303960573]
[2024-06-20 19:21:26,372 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-06-20 19:21:26,372 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:21:26,372 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:21:26,373 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:21:26,374 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-06-20 19:21:28,035 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-06-20 19:21:28,035 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:21:28,111 INFO  L262         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-06-20 19:21:28,117 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:21:36,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-20 19:21:36,860 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:21:36,860 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:21:36,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303960573]
[2024-06-20 19:21:36,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [303960573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:36,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:36,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:21:36,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848529715]
[2024-06-20 19:21:36,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:36,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:21:36,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:21:36,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:21:36,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:21:41,632 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:21:41,632 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 651 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:41,632 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:41,632 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:21:41,633 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:58,516 INFO  L124   PetriNetUnfolderBase]: 11638/16013 cut-off events.
[2024-06-20 19:21:58,517 INFO  L125   PetriNetUnfolderBase]: For 139370/139420 co-relation queries the response was YES.
[2024-06-20 19:21:58,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75776 conditions, 16013 events. 11638/16013 cut-off events. For 139370/139420 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 86736 event pairs, 5132 based on Foata normal form. 30/16034 useless extension candidates. Maximal degree in co-relation 75751. Up to 15296 conditions per place. 
[2024-06-20 19:21:58,602 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 86 selfloop transitions, 50 changer transitions 0/144 dead transitions.
[2024-06-20 19:21:58,603 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 144 transitions, 1297 flow
[2024-06-20 19:21:58,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:21:58,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:21:58,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions.
[2024-06-20 19:21:58,604 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5849673202614379
[2024-06-20 19:21:58,604 INFO  L175             Difference]: Start difference. First operand has 79 places, 93 transitions, 651 flow. Second operand 6 states and 179 transitions.
[2024-06-20 19:21:58,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 144 transitions, 1297 flow
[2024-06-20 19:21:58,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 144 transitions, 1231 flow, removed 25 selfloop flow, removed 2 redundant places.
[2024-06-20 19:21:58,637 INFO  L231             Difference]: Finished difference. Result has 84 places, 103 transitions, 860 flow
[2024-06-20 19:21:58,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=84, PETRI_TRANSITIONS=103}
[2024-06-20 19:21:58,638 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places.
[2024-06-20 19:21:58,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 860 flow
[2024-06-20 19:21:58,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:58,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:58,638 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:58,664 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2024-06-20 19:21:58,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:21:58,850 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:21:58,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:58,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 1711528428, now seen corresponding path program 1 times
[2024-06-20 19:21:58,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:21:58,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53984268]
[2024-06-20 19:21:58,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:58,851 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:21:58,851 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:21:58,852 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:21:58,853 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-06-20 19:22:00,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:00,707 INFO  L262         TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core
[2024-06-20 19:22:00,713 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:22:08,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:22:08,746 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:22:08,746 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:22:08,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53984268]
[2024-06-20 19:22:08,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [53984268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:08,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:08,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:22:08,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375059521]
[2024-06-20 19:22:08,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:08,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:22:08,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:22:08,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:22:08,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:22:16,473 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:22:16,473 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 103 transitions, 860 flow. Second operand  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:16,473 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:16,473 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:22:16,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:36,793 INFO  L124   PetriNetUnfolderBase]: 10292/14422 cut-off events.
[2024-06-20 19:22:36,793 INFO  L125   PetriNetUnfolderBase]: For 140064/140064 co-relation queries the response was YES.
[2024-06-20 19:22:36,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70994 conditions, 14422 events. 10292/14422 cut-off events. For 140064/140064 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 79083 event pairs, 4437 based on Foata normal form. 6/14425 useless extension candidates. Maximal degree in co-relation 70966. Up to 13917 conditions per place. 
[2024-06-20 19:22:36,879 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 118 selfloop transitions, 20 changer transitions 0/145 dead transitions.
[2024-06-20 19:22:36,879 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 145 transitions, 1292 flow
[2024-06-20 19:22:36,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:22:36,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:22:36,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions.
[2024-06-20 19:22:36,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5182072829131653
[2024-06-20 19:22:36,882 INFO  L175             Difference]: Start difference. First operand has 84 places, 103 transitions, 860 flow. Second operand 7 states and 185 transitions.
[2024-06-20 19:22:36,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 145 transitions, 1292 flow
[2024-06-20 19:22:36,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 145 transitions, 1145 flow, removed 41 selfloop flow, removed 3 redundant places.
[2024-06-20 19:22:36,930 INFO  L231             Difference]: Finished difference. Result has 88 places, 106 transitions, 825 flow
[2024-06-20 19:22:36,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=88, PETRI_TRANSITIONS=106}
[2024-06-20 19:22:36,931 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places.
[2024-06-20 19:22:36,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 825 flow
[2024-06-20 19:22:36,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:36,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:36,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:36,958 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-06-20 19:22:37,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:22:37,145 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:22:37,146 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:37,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 333601215, now seen corresponding path program 1 times
[2024-06-20 19:22:37,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:22:37,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991141997]
[2024-06-20 19:22:37,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:37,147 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:22:37,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:22:37,148 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:22:37,199 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-06-20 19:22:38,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:38,156 INFO  L262         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-06-20 19:22:38,163 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:22:45,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:22:45,361 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:22:45,361 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:22:45,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991141997]
[2024-06-20 19:22:45,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [991141997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:45,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:45,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:22:45,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493632752]
[2024-06-20 19:22:45,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:45,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:22:45,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:22:45,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:22:45,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:22:47,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:22:47,416 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 825 flow. Second operand  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-20 19:22:47,416 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:47,416 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:22:47,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:03,689 INFO  L124   PetriNetUnfolderBase]: 10278/14660 cut-off events.
[2024-06-20 19:23:03,690 INFO  L125   PetriNetUnfolderBase]: For 144000/144000 co-relation queries the response was YES.
[2024-06-20 19:23:03,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70642 conditions, 14660 events. 10278/14660 cut-off events. For 144000/144000 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 81907 event pairs, 4495 based on Foata normal form. 4/14661 useless extension candidates. Maximal degree in co-relation 70613. Up to 13956 conditions per place. 
[2024-06-20 19:23:03,772 INFO  L140   encePairwiseOnDemand]: 43/51 looper letters, 109 selfloop transitions, 9 changer transitions 0/125 dead transitions.
[2024-06-20 19:23:03,772 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 125 transitions, 1145 flow
[2024-06-20 19:23:03,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:23:03,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:23:03,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions.
[2024-06-20 19:23:03,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5392156862745098
[2024-06-20 19:23:03,774 INFO  L175             Difference]: Start difference. First operand has 88 places, 106 transitions, 825 flow. Second operand 4 states and 110 transitions.
[2024-06-20 19:23:03,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 125 transitions, 1145 flow
[2024-06-20 19:23:03,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 1063 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 19:23:03,838 INFO  L231             Difference]: Finished difference. Result has 87 places, 110 transitions, 824 flow
[2024-06-20 19:23:03,838 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=824, PETRI_PLACES=87, PETRI_TRANSITIONS=110}
[2024-06-20 19:23:03,839 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places.
[2024-06-20 19:23:03,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 824 flow
[2024-06-20 19:23:03,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-20 19:23:03,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:03,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:03,860 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0
[2024-06-20 19:23:04,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:23:04,042 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:04,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:04,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -434481143, now seen corresponding path program 1 times
[2024-06-20 19:23:04,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:23:04,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557512062]
[2024-06-20 19:23:04,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:04,043 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:23:04,043 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:23:04,044 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:23:04,046 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2024-06-20 19:23:05,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:05,921 INFO  L262         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-06-20 19:23:05,927 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:23:15,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:23:15,266 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:23:15,267 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:23:15,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557512062]
[2024-06-20 19:23:15,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557512062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:15,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:15,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:23:15,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381685225]
[2024-06-20 19:23:15,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:15,267 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:23:15,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:23:15,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:23:15,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:23:23,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:23:23,502 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 824 flow. Second operand  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:23,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:23,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:23:23,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:45,289 INFO  L124   PetriNetUnfolderBase]: 11600/15970 cut-off events.
[2024-06-20 19:23:45,289 INFO  L125   PetriNetUnfolderBase]: For 196776/196808 co-relation queries the response was YES.
[2024-06-20 19:23:45,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84385 conditions, 15970 events. 11600/15970 cut-off events. For 196776/196808 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 86611 event pairs, 5068 based on Foata normal form. 11/15978 useless extension candidates. Maximal degree in co-relation 84355. Up to 15613 conditions per place. 
[2024-06-20 19:23:45,401 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 120 selfloop transitions, 24 changer transitions 0/152 dead transitions.
[2024-06-20 19:23:45,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 1281 flow
[2024-06-20 19:23:45,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:23:45,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:23:45,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions.
[2024-06-20 19:23:45,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5522875816993464
[2024-06-20 19:23:45,519 INFO  L175             Difference]: Start difference. First operand has 87 places, 110 transitions, 824 flow. Second operand 6 states and 169 transitions.
[2024-06-20 19:23:45,519 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 1281 flow
[2024-06-20 19:23:45,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 152 transitions, 1230 flow, removed 19 selfloop flow, removed 2 redundant places.
[2024-06-20 19:23:45,577 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 914 flow
[2024-06-20 19:23:45,577 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=91, PETRI_TRANSITIONS=114}
[2024-06-20 19:23:45,577 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places.
[2024-06-20 19:23:45,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 914 flow
[2024-06-20 19:23:45,578 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:23:45,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:45,578 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:45,609 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0
[2024-06-20 19:23:45,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:23:45,780 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:45,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:45,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384764081, now seen corresponding path program 1 times
[2024-06-20 19:23:45,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:23:45,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066953654]
[2024-06-20 19:23:45,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:45,781 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:23:45,781 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:23:45,782 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:23:45,783 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process
[2024-06-20 19:23:47,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:47,626 INFO  L262         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:23:47,634 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:23:56,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:23:56,839 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:23:56,839 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:23:56,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066953654]
[2024-06-20 19:23:56,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066953654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:56,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:56,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:23:56,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442189540]
[2024-06-20 19:23:56,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:56,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:23:56,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:23:56,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:23:56,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:24:01,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:24:01,688 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 914 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:24:01,688 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:01,688 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:24:01,688 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:23,600 INFO  L124   PetriNetUnfolderBase]: 11913/16340 cut-off events.
[2024-06-20 19:24:23,600 INFO  L125   PetriNetUnfolderBase]: For 208799/208799 co-relation queries the response was YES.
[2024-06-20 19:24:23,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85179 conditions, 16340 events. 11913/16340 cut-off events. For 208799/208799 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 86350 event pairs, 4954 based on Foata normal form. 9/16346 useless extension candidates. Maximal degree in co-relation 85148. Up to 15784 conditions per place. 
[2024-06-20 19:24:23,693 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 121 selfloop transitions, 47 changer transitions 0/174 dead transitions.
[2024-06-20 19:24:23,693 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 174 transitions, 1518 flow
[2024-06-20 19:24:23,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:24:23,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:24:23,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions.
[2024-06-20 19:24:23,778 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5322128851540616
[2024-06-20 19:24:23,778 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 914 flow. Second operand 7 states and 190 transitions.
[2024-06-20 19:24:23,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 174 transitions, 1518 flow
[2024-06-20 19:24:23,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 174 transitions, 1370 flow, removed 52 selfloop flow, removed 4 redundant places.
[2024-06-20 19:24:23,855 INFO  L231             Difference]: Finished difference. Result has 95 places, 129 transitions, 1040 flow
[2024-06-20 19:24:23,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1040, PETRI_PLACES=95, PETRI_TRANSITIONS=129}
[2024-06-20 19:24:23,856 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places.
[2024-06-20 19:24:23,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 129 transitions, 1040 flow
[2024-06-20 19:24:23,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:24:23,856 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:23,856 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:23,881 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0
[2024-06-20 19:24:24,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:24:24,058 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:24,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:24,060 INFO  L85        PathProgramCache]: Analyzing trace with hash 765443913, now seen corresponding path program 2 times
[2024-06-20 19:24:24,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:24:24,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434845279]
[2024-06-20 19:24:24,061 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-06-20 19:24:24,061 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:24:24,061 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:24:24,062 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:24:24,063 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process
[2024-06-20 19:24:25,928 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-06-20 19:24:25,928 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:24:26,012 INFO  L262         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:24:26,017 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:24:35,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:24:35,580 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:24:35,580 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:24:35,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434845279]
[2024-06-20 19:24:35,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434845279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:35,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:35,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:24:35,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825380805]
[2024-06-20 19:24:35,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:35,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:24:35,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:24:35,581 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:24:35,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:24:43,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:24:43,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 129 transitions, 1040 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:24:43,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:43,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:24:43,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:03,994 INFO  L124   PetriNetUnfolderBase]: 12045/16527 cut-off events.
[2024-06-20 19:25:03,994 INFO  L125   PetriNetUnfolderBase]: For 229412/229430 co-relation queries the response was YES.
[2024-06-20 19:25:04,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88077 conditions, 16527 events. 12045/16527 cut-off events. For 229412/229430 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 87353 event pairs, 4981 based on Foata normal form. 19/16537 useless extension candidates. Maximal degree in co-relation 88044. Up to 15807 conditions per place. 
[2024-06-20 19:25:04,093 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 115 selfloop transitions, 67 changer transitions 0/188 dead transitions.
[2024-06-20 19:25:04,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1660 flow
[2024-06-20 19:25:04,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:25:04,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:25:04,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions.
[2024-06-20 19:25:04,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5406162464985994
[2024-06-20 19:25:04,095 INFO  L175             Difference]: Start difference. First operand has 95 places, 129 transitions, 1040 flow. Second operand 7 states and 193 transitions.
[2024-06-20 19:25:04,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1660 flow
[2024-06-20 19:25:04,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 188 transitions, 1588 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-20 19:25:04,190 INFO  L231             Difference]: Finished difference. Result has 100 places, 145 transitions, 1277 flow
[2024-06-20 19:25:04,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1277, PETRI_PLACES=100, PETRI_TRANSITIONS=145}
[2024-06-20 19:25:04,203 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places.
[2024-06-20 19:25:04,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 145 transitions, 1277 flow
[2024-06-20 19:25:04,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:25:04,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:04,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:04,231 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0
[2024-06-20 19:25:04,412 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:25:04,412 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-20 19:25:04,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:04,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 1517498061, now seen corresponding path program 3 times
[2024-06-20 19:25:04,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:25:04,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429807805]
[2024-06-20 19:25:04,414 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-06-20 19:25:04,414 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:25:04,414 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:25:04,415 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:25:04,416 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process
[2024-06-20 19:25:06,222 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-06-20 19:25:06,222 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:25:06,301 INFO  L262         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:25:06,307 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:25:16,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:25:16,427 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:25:16,427 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:25:16,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429807805]
[2024-06-20 19:25:16,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [429807805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:16,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:16,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:25:16,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857437600]
[2024-06-20 19:25:16,427 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:16,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:25:16,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:25:16,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:25:16,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:25:24,806 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:25:24,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 145 transitions, 1277 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:25:24,807 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:24,807 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:25:24,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:44,570 INFO  L124   PetriNetUnfolderBase]: 12049/16533 cut-off events.
[2024-06-20 19:25:44,570 INFO  L125   PetriNetUnfolderBase]: For 250213/250231 co-relation queries the response was YES.
[2024-06-20 19:25:44,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90489 conditions, 16533 events. 12049/16533 cut-off events. For 250213/250231 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 87350 event pairs, 4957 based on Foata normal form. 19/16543 useless extension candidates. Maximal degree in co-relation 90453. Up to 15813 conditions per place. 
[2024-06-20 19:25:44,674 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 120 selfloop transitions, 73 changer transitions 0/199 dead transitions.
[2024-06-20 19:25:44,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 199 transitions, 1917 flow
[2024-06-20 19:25:44,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:25:44,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:25:44,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions.
[2024-06-20 19:25:44,764 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378151260504201
[2024-06-20 19:25:44,765 INFO  L175             Difference]: Start difference. First operand has 100 places, 145 transitions, 1277 flow. Second operand 7 states and 192 transitions.
[2024-06-20 19:25:44,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 199 transitions, 1917 flow
[2024-06-20 19:25:44,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 199 transitions, 1814 flow, removed 26 selfloop flow, removed 2 redundant places.
[2024-06-20 19:25:44,892 INFO  L231             Difference]: Finished difference. Result has 105 places, 154 transitions, 1458 flow
[2024-06-20 19:25:44,892 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1458, PETRI_PLACES=105, PETRI_TRANSITIONS=154}
[2024-06-20 19:25:44,898 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 51 predicate places.
[2024-06-20 19:25:44,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 1458 flow
[2024-06-20 19:25:44,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:25:44,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:44,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:44,924 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0
[2024-06-20 19:25:45,123 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:25:45,123 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:45,124 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:45,124 INFO  L85        PathProgramCache]: Analyzing trace with hash 773062473, now seen corresponding path program 4 times
[2024-06-20 19:25:45,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:25:45,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038662821]
[2024-06-20 19:25:45,125 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-06-20 19:25:45,125 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:25:45,125 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:25:45,126 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:25:45,127 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process
[2024-06-20 19:25:46,915 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-06-20 19:25:46,915 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:25:46,994 INFO  L262         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:25:47,008 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:25:56,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:25:56,688 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:25:56,688 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:25:56,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038662821]
[2024-06-20 19:25:56,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038662821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:56,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:56,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:25:56,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282477785]
[2024-06-20 19:25:56,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:56,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:25:56,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:25:56,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:25:56,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:26:01,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:26:01,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 154 transitions, 1458 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:26:01,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:01,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:26:01,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:26:21,441 INFO  L124   PetriNetUnfolderBase]: 12028/16503 cut-off events.
[2024-06-20 19:26:21,441 INFO  L125   PetriNetUnfolderBase]: For 267038/267056 co-relation queries the response was YES.
[2024-06-20 19:26:21,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91816 conditions, 16503 events. 12028/16503 cut-off events. For 267038/267056 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 87134 event pairs, 4957 based on Foata normal form. 13/16507 useless extension candidates. Maximal degree in co-relation 91778. Up to 15623 conditions per place. 
[2024-06-20 19:26:21,549 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 101 selfloop transitions, 90 changer transitions 0/197 dead transitions.
[2024-06-20 19:26:21,549 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 197 transitions, 1965 flow
[2024-06-20 19:26:21,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:26:21,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:26:21,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions.
[2024-06-20 19:26:21,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5350140056022409
[2024-06-20 19:26:21,646 INFO  L175             Difference]: Start difference. First operand has 105 places, 154 transitions, 1458 flow. Second operand 7 states and 191 transitions.
[2024-06-20 19:26:21,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 197 transitions, 1965 flow
[2024-06-20 19:26:21,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 197 transitions, 1763 flow, removed 48 selfloop flow, removed 3 redundant places.
[2024-06-20 19:26:21,778 INFO  L231             Difference]: Finished difference. Result has 109 places, 154 transitions, 1447 flow
[2024-06-20 19:26:21,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1447, PETRI_PLACES=109, PETRI_TRANSITIONS=154}
[2024-06-20 19:26:21,779 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 55 predicate places.
[2024-06-20 19:26:21,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 154 transitions, 1447 flow
[2024-06-20 19:26:21,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-20 19:26:21,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:26:21,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:26:21,805 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0
[2024-06-20 19:26:21,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:26:21,983 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-20 19:26:21,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:26:21,983 INFO  L85        PathProgramCache]: Analyzing trace with hash 705432649, now seen corresponding path program 1 times
[2024-06-20 19:26:21,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:26:21,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977412341]
[2024-06-20 19:26:21,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:26:22,004 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:26:22,004 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:26:22,005 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:26:22,031 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process
[2024-06-20 19:26:23,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:23,798 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:26:23,804 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:26:34,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:26:34,288 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:26:34,288 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:26:34,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977412341]
[2024-06-20 19:26:34,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [977412341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:34,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:34,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:26:34,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766096257]
[2024-06-20 19:26:34,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:34,289 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:26:34,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:26:34,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:26:34,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:26:41,145 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:26:41,145 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 154 transitions, 1447 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:41,145 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:41,145 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:26:41,145 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:03,521 INFO  L124   PetriNetUnfolderBase]: 11556/16022 cut-off events.
[2024-06-20 19:27:03,522 INFO  L125   PetriNetUnfolderBase]: For 288466/288512 co-relation queries the response was YES.
[2024-06-20 19:27:03,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91573 conditions, 16022 events. 11556/16022 cut-off events. For 288466/288512 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 87576 event pairs, 3925 based on Foata normal form. 14/16033 useless extension candidates. Maximal degree in co-relation 91534. Up to 15569 conditions per place. 
[2024-06-20 19:27:03,789 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 171 selfloop transitions, 22 changer transitions 0/203 dead transitions.
[2024-06-20 19:27:03,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 203 transitions, 2017 flow
[2024-06-20 19:27:03,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:27:03,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:27:03,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions.
[2024-06-20 19:27:03,878 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378151260504201
[2024-06-20 19:27:03,879 INFO  L175             Difference]: Start difference. First operand has 109 places, 154 transitions, 1447 flow. Second operand 7 states and 192 transitions.
[2024-06-20 19:27:03,879 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 203 transitions, 2017 flow
[2024-06-20 19:27:04,021 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 203 transitions, 1794 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 19:27:04,023 INFO  L231             Difference]: Finished difference. Result has 110 places, 157 transitions, 1350 flow
[2024-06-20 19:27:04,023 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1350, PETRI_PLACES=110, PETRI_TRANSITIONS=157}
[2024-06-20 19:27:04,024 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places.
[2024-06-20 19:27:04,024 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 157 transitions, 1350 flow
[2024-06-20 19:27:04,024 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:04,024 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:04,024 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:04,048 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0
[2024-06-20 19:27:04,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:27:04,229 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-20 19:27:04,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:04,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -584012587, now seen corresponding path program 2 times
[2024-06-20 19:27:04,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:27:04,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846946566]
[2024-06-20 19:27:04,233 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-06-20 19:27:04,233 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:27:04,233 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:27:04,234 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:27:04,235 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process
[2024-06-20 19:27:06,017 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-06-20 19:27:06,017 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:27:06,099 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-06-20 19:27:06,105 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:27:16,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:27:16,571 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:27:16,571 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:27:16,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846946566]
[2024-06-20 19:27:16,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846946566] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:27:16,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:27:16,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:27:16,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087071873]
[2024-06-20 19:27:16,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:27:16,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:27:16,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:27:16,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:27:16,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:27:20,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:27:20,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 157 transitions, 1350 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:20,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:20,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:27:20,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:46,315 INFO  L124   PetriNetUnfolderBase]: 11620/16119 cut-off events.
[2024-06-20 19:27:46,315 INFO  L125   PetriNetUnfolderBase]: For 327678/327724 co-relation queries the response was YES.
[2024-06-20 19:27:46,356 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94872 conditions, 16119 events. 11620/16119 cut-off events. For 327678/327724 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 88276 event pairs, 4444 based on Foata normal form. 20/16131 useless extension candidates. Maximal degree in co-relation 94832. Up to 15616 conditions per place. 
[2024-06-20 19:27:46,427 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 163 selfloop transitions, 33 changer transitions 0/206 dead transitions.
[2024-06-20 19:27:46,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 206 transitions, 1934 flow
[2024-06-20 19:27:46,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:27:46,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:27:46,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions.
[2024-06-20 19:27:46,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5406162464985994
[2024-06-20 19:27:46,519 INFO  L175             Difference]: Start difference. First operand has 110 places, 157 transitions, 1350 flow. Second operand 7 states and 193 transitions.
[2024-06-20 19:27:46,519 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 206 transitions, 1934 flow
[2024-06-20 19:27:46,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 206 transitions, 1834 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-20 19:27:46,692 INFO  L231             Difference]: Finished difference. Result has 112 places, 160 transitions, 1407 flow
[2024-06-20 19:27:46,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1407, PETRI_PLACES=112, PETRI_TRANSITIONS=160}
[2024-06-20 19:27:46,693 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places.
[2024-06-20 19:27:46,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 160 transitions, 1407 flow
[2024-06-20 19:27:46,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:46,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:46,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:46,722 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0
[2024-06-20 19:27:46,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:27:46,919 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:46,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:46,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -22170003, now seen corresponding path program 3 times
[2024-06-20 19:27:46,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:27:46,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110869927]
[2024-06-20 19:27:46,920 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-06-20 19:27:46,920 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:27:46,921 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:27:46,921 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:27:46,923 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process
[2024-06-20 19:27:48,642 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-06-20 19:27:48,642 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:27:48,723 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-06-20 19:27:48,734 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:28:00,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:28:00,393 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:28:00,393 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:28:00,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110869927]
[2024-06-20 19:28:00,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110869927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:00,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:00,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:00,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347685114]
[2024-06-20 19:28:00,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:00,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:00,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:28:00,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:00,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:04,943 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:28:04,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 160 transitions, 1407 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:04,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:04,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:28:04,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:17,520 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-06-20 19:28:31,809 INFO  L124   PetriNetUnfolderBase]: 11792/16376 cut-off events.
[2024-06-20 19:28:31,810 INFO  L125   PetriNetUnfolderBase]: For 377692/377738 co-relation queries the response was YES.
[2024-06-20 19:28:31,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99684 conditions, 16376 events. 11792/16376 cut-off events. For 377692/377738 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 89777 event pairs, 4451 based on Foata normal form. 76/16449 useless extension candidates. Maximal degree in co-relation 99643. Up to 15618 conditions per place. 
[2024-06-20 19:28:31,921 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 148 selfloop transitions, 53 changer transitions 0/211 dead transitions.
[2024-06-20 19:28:31,921 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 211 transitions, 2023 flow
[2024-06-20 19:28:32,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:28:32,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:28:32,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions.
[2024-06-20 19:28:32,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5574229691876751
[2024-06-20 19:28:32,005 INFO  L175             Difference]: Start difference. First operand has 112 places, 160 transitions, 1407 flow. Second operand 7 states and 199 transitions.
[2024-06-20 19:28:32,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 211 transitions, 2023 flow
[2024-06-20 19:28:32,213 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 211 transitions, 1898 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-20 19:28:32,215 INFO  L231             Difference]: Finished difference. Result has 114 places, 165 transitions, 1505 flow
[2024-06-20 19:28:32,215 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1505, PETRI_PLACES=114, PETRI_TRANSITIONS=165}
[2024-06-20 19:28:32,216 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places.
[2024-06-20 19:28:32,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 165 transitions, 1505 flow
[2024-06-20 19:28:32,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:32,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:32,216 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:32,249 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0
[2024-06-20 19:28:32,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:28:32,418 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-20 19:28:32,433 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:32,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -21985305, now seen corresponding path program 1 times
[2024-06-20 19:28:32,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:28:32,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098798681]
[2024-06-20 19:28:32,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:32,434 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:28:32,434 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:28:32,435 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:28:32,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process
[2024-06-20 19:28:34,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:34,247 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-06-20 19:28:34,252 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:28:45,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:28:45,173 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:28:45,173 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:28:45,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098798681]
[2024-06-20 19:28:45,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098798681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:45,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:45,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:45,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802520902]
[2024-06-20 19:28:45,174 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:45,174 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:45,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:28:45,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:45,174 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:50,282 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:28:50,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 165 transitions, 1505 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:50,283 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:50,283 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:28:50,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:18,372 INFO  L124   PetriNetUnfolderBase]: 12496/17187 cut-off events.
[2024-06-20 19:29:18,372 INFO  L125   PetriNetUnfolderBase]: For 426288/426288 co-relation queries the response was YES.
[2024-06-20 19:29:18,506 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106856 conditions, 17187 events. 12496/17187 cut-off events. For 426288/426288 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 91678 event pairs, 4600 based on Foata normal form. 24/17193 useless extension candidates. Maximal degree in co-relation 106814. Up to 16480 conditions per place. 
[2024-06-20 19:29:18,582 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 167 selfloop transitions, 52 changer transitions 0/225 dead transitions.
[2024-06-20 19:29:18,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 225 transitions, 2188 flow
[2024-06-20 19:29:18,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:29:18,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:29:18,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions.
[2024-06-20 19:29:18,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5318627450980392
[2024-06-20 19:29:18,674 INFO  L175             Difference]: Start difference. First operand has 114 places, 165 transitions, 1505 flow. Second operand 8 states and 217 transitions.
[2024-06-20 19:29:18,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 225 transitions, 2188 flow
[2024-06-20 19:29:18,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 225 transitions, 2007 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-20 19:29:18,922 INFO  L231             Difference]: Finished difference. Result has 117 places, 170 transitions, 1545 flow
[2024-06-20 19:29:18,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1545, PETRI_PLACES=117, PETRI_TRANSITIONS=170}
[2024-06-20 19:29:18,923 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 63 predicate places.
[2024-06-20 19:29:18,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 170 transitions, 1545 flow
[2024-06-20 19:29:18,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:18,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:18,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:18,949 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0
[2024-06-20 19:29:19,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:29:19,149 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:19,150 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:19,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 1128453174, now seen corresponding path program 1 times
[2024-06-20 19:29:19,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:29:19,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308286482]
[2024-06-20 19:29:19,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:29:19,152 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:29:19,152 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:29:19,153 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:29:19,154 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process
[2024-06-20 19:29:20,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:20,284 INFO  L262         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-06-20 19:29:20,289 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:29:30,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:29:30,763 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:29:30,763 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:29:30,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308286482]
[2024-06-20 19:29:30,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308286482] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:30,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:30,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:29:30,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112175640]
[2024-06-20 19:29:30,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:30,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:29:30,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:29:30,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:29:30,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:29:34,837 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:29:34,837 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 170 transitions, 1545 flow. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:34,837 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:34,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:29:34,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:52,281 INFO  L124   PetriNetUnfolderBase]: 12528/17242 cut-off events.
[2024-06-20 19:29:52,281 INFO  L125   PetriNetUnfolderBase]: For 454769/454769 co-relation queries the response was YES.
[2024-06-20 19:29:52,324 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110417 conditions, 17242 events. 12528/17242 cut-off events. For 454769/454769 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 92019 event pairs, 4610 based on Foata normal form. 4/17240 useless extension candidates. Maximal degree in co-relation 110374. Up to 16916 conditions per place. 
[2024-06-20 19:29:52,402 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 181 selfloop transitions, 20 changer transitions 0/207 dead transitions.
[2024-06-20 19:29:52,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 207 transitions, 2235 flow
[2024-06-20 19:29:52,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:29:52,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:29:52,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions.
[2024-06-20 19:29:52,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5450980392156862
[2024-06-20 19:29:52,404 INFO  L175             Difference]: Start difference. First operand has 117 places, 170 transitions, 1545 flow. Second operand 5 states and 139 transitions.
[2024-06-20 19:29:52,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 207 transitions, 2235 flow
[2024-06-20 19:29:52,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 207 transitions, 2056 flow, removed 41 selfloop flow, removed 6 redundant places.
[2024-06-20 19:29:52,602 INFO  L231             Difference]: Finished difference. Result has 116 places, 178 transitions, 1551 flow
[2024-06-20 19:29:52,603 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1551, PETRI_PLACES=116, PETRI_TRANSITIONS=178}
[2024-06-20 19:29:52,603 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 62 predicate places.
[2024-06-20 19:29:52,603 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 178 transitions, 1551 flow
[2024-06-20 19:29:52,603 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:29:52,603 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:52,604 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:52,623 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0
[2024-06-20 19:29:52,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:29:52,820 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:52,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:52,821 INFO  L85        PathProgramCache]: Analyzing trace with hash -430100371, now seen corresponding path program 2 times
[2024-06-20 19:29:52,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:29:52,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017504100]
[2024-06-20 19:29:52,821 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-06-20 19:29:52,821 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:29:52,821 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:29:52,823 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:29:52,835 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process
[2024-06-20 19:29:54,536 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-06-20 19:29:54,537 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:29:54,615 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-06-20 19:29:54,621 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:30:06,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:30:06,134 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:30:06,134 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:30:06,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017504100]
[2024-06-20 19:30:06,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017504100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:06,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:06,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:30:06,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652604978]
[2024-06-20 19:30:06,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:06,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:30:06,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:30:06,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:30:06,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:30:11,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51
[2024-06-20 19:30:11,231 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 178 transitions, 1551 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:11,231 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:30:11,231 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51
[2024-06-20 19:30:11,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:35,123 INFO  L124   PetriNetUnfolderBase]: 12672/17459 cut-off events.
[2024-06-20 19:30:35,124 INFO  L125   PetriNetUnfolderBase]: For 506068/506088 co-relation queries the response was YES.
[2024-06-20 19:30:35,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 114437 conditions, 17459 events. 12672/17459 cut-off events. For 506068/506088 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 93384 event pairs, 4645 based on Foata normal form. 35/17485 useless extension candidates. Maximal degree in co-relation 114393. Up to 16573 conditions per place. 
[2024-06-20 19:30:35,259 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 153 selfloop transitions, 77 changer transitions 0/236 dead transitions.
[2024-06-20 19:30:35,260 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 236 transitions, 2264 flow
[2024-06-20 19:30:35,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:30:35,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:30:35,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions.
[2024-06-20 19:30:35,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5392156862745098
[2024-06-20 19:30:35,349 INFO  L175             Difference]: Start difference. First operand has 116 places, 178 transitions, 1551 flow. Second operand 8 states and 220 transitions.
[2024-06-20 19:30:35,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 236 transitions, 2264 flow
[2024-06-20 19:30:35,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 236 transitions, 2196 flow, removed 30 selfloop flow, removed 1 redundant places.
[2024-06-20 19:30:35,554 INFO  L231             Difference]: Finished difference. Result has 123 places, 183 transitions, 1766 flow
[2024-06-20 19:30:35,554 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1766, PETRI_PLACES=123, PETRI_TRANSITIONS=183}
[2024-06-20 19:30:35,556 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 69 predicate places.
[2024-06-20 19:30:35,557 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 183 transitions, 1766 flow
[2024-06-20 19:30:35,557 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:30:35,557 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:35,557 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:35,577 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0
[2024-06-20 19:30:35,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:30:35,772 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:35,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:35,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -430285069, now seen corresponding path program 4 times
[2024-06-20 19:30:35,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-06-20 19:30:35,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190517927]
[2024-06-20 19:30:35,773 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-06-20 19:30:35,774 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-06-20 19:30:35,774 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-06-20 19:30:35,775 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-06-20 19:30:35,776 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process
[2024-06-20 19:30:37,463 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-06-20 19:30:37,464 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-06-20 19:30:37,543 INFO  L262         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-06-20 19:30:37,548 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-06-20 19:30:49,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:30:49,483 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-06-20 19:30:49,483 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-06-20 19:30:49,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190517927]
[2024-06-20 19:30:49,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [190517927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:49,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:49,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:30:49,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224442280]
[2024-06-20 19:30:49,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:49,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:30:49,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-06-20 19:30:49,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:30:49,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
Killed by 15