./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix032.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/mix032.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/mix032.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.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 18:58:16,512 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 18:58:16,582 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 18:58:16,590 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 18:58:16,590 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 18:58:16,628 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 18:58:16,628 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 18:58:16,629 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 18:58:16,629 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 18:58:16,633 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 18:58:16,633 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 18:58:16,634 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 18:58:16,635 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 18:58:16,636 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 18:58:16,636 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 18:58:16,636 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 18:58:16,637 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 18:58:16,637 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 18:58:16,637 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 18:58:16,638 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 18:58:16,639 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 18:58:16,639 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 18:58:16,639 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 18:58:16,640 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 18:58:16,640 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 18:58:16,640 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 18:58:16,641 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 18:58:16,641 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 18:58:16,641 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 18:58:16,642 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 18:58:16,643 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 18:58:16,643 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 18:58:16,643 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:58:16,643 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 18:58:16,644 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 18:58:16,644 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 18:58:16,644 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 18:58:16,644 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 18:58:16,644 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 18:58:16,645 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 18:58:16,645 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 18:58:16,645 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 18:58:16,645 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 18:58:16,646 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 18:58:16,915 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 18:58:16,941 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 18:58:16,944 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 18:58:16,945 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 18:58:16,946 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 18:58:16,947 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/mix032.oepc.yml/witness.yml
[2024-06-20 18:58:17,264 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 18:58:17,264 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 18:58:17,265 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i
[2024-06-20 18:58:18,373 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 18:58:18,681 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 18:58:18,682 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i
[2024-06-20 18:58:18,720 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a7bbb5d/bfb1e53cd6c9472484e7ec4911fe36c5/FLAG53a83dd40
[2024-06-20 18:58:18,733 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a7bbb5d/bfb1e53cd6c9472484e7ec4911fe36c5
[2024-06-20 18:58:18,733 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 18:58:18,735 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 18:58:18,736 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 18:58:18,736 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 18:58:18,741 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 18:58:18,741 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:58:17" (1/2) ...
[2024-06-20 18:58:18,742 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461c8469 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:58:18, skipping insertion in model container
[2024-06-20 18:58:18,742 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:58:17" (1/2) ...
[2024-06-20 18:58:18,744 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62df195e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:58:18, skipping insertion in model container
[2024-06-20 18:58:18,744 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:58:18" (2/2) ...
[2024-06-20 18:58:18,744 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461c8469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:18, skipping insertion in model container
[2024-06-20 18:58:18,744 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:58:18" (2/2) ...
[2024-06-20 18:58:18,745 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 18:58:18,830 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 18:58:18,831 INFO  L97    edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )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_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-20 18:58:18,832 INFO  L97    edCorrectnessWitness]: Location invariant before [L860-L860] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )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_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-20 18:58:18,833 INFO  L97    edCorrectnessWitness]: Location invariant before [L861-L861] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )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_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)
[2024-06-20 18:58:18,834 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 18:58:18,834 INFO  L106   edCorrectnessWitness]: ghost_update [L856-L856] multithreaded = 1;
[2024-06-20 18:58:18,863 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 18:58:19,176 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:58:19,186 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 18:58:19,592 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:58:19,634 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 18:58:19,634 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19 WrapperNode
[2024-06-20 18:58:19,634 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 18:58:19,636 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 18:58:19,636 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 18:58:19,636 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 18:58:19,643 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,697 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,855 INFO  L138                Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130
[2024-06-20 18:58:19,856 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 18:58:19,857 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 18:58:19,857 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 18:58:19,857 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 18:58:19,868 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,868 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,909 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,955 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 18:58:19,956 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,956 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,997 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:19,998 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:20,015 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:20,023 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:20,046 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 18:58:20,048 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 18:58:20,048 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 18:58:20,048 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 18:58:20,049 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (1/1) ...
[2024-06-20 18:58:20,054 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:58:20,064 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 18:58:20,081 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 18:58:20,205 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 18:58:20,221 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 18:58:20,222 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 18:58:20,222 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 18:58:20,222 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 18:58:20,223 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 18:58:20,223 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 18:58:20,223 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 18:58:20,223 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 18:58:20,223 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 18:58:20,223 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 18:58:20,224 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 18:58:20,224 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 18:58:20,225 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 18:58:20,366 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 18:58:20,368 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 18:58:22,185 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 18:58:22,187 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 18:58:22,606 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 18:58:22,606 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 18:58:22,607 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:58:22 BoogieIcfgContainer
[2024-06-20 18:58:22,607 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 18:58:22,609 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 18:58:22,609 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 18:58:22,612 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 18:58:22,612 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:58:17" (1/4) ...
[2024-06-20 18:58:22,613 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532a17a2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:58:22, skipping insertion in model container
[2024-06-20 18:58:22,613 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:58:18" (2/4) ...
[2024-06-20 18:58:22,613 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532a17a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:58:22, skipping insertion in model container
[2024-06-20 18:58:22,613 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:58:19" (3/4) ...
[2024-06-20 18:58:22,614 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532a17a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:58:22, skipping insertion in model container
[2024-06-20 18:58:22,614 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:58:22" (4/4) ...
[2024-06-20 18:58:22,615 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix032.oepc.i
[2024-06-20 18:58:22,632 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 18:58:22,632 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 18:58:22,632 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 18:58:22,768 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 18:58:22,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow
[2024-06-20 18:58:22,905 INFO  L124   PetriNetUnfolderBase]: 0/41 cut-off events.
[2024-06-20 18:58:22,905 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:58:22,909 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 18:58:22,909 INFO  L82        GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow
[2024-06-20 18:58:22,913 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow
[2024-06-20 18:58:22,941 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 18:58:22,961 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;@4b6b3622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 18:58:22,961 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 18:58:22,972 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 18:58:22,973 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 18:58:22,973 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:58:22,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:22,974 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 18:58:22,974 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:23,009 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:23,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 385894303, now seen corresponding path program 1 times
[2024-06-20 18:58:23,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:23,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861033007]
[2024-06-20 18:58:23,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:23,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:23,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:33,697 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 18:58:33,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:33,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861033007]
[2024-06-20 18:58:33,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861033007] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:33,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:33,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 18:58:33,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309725902]
[2024-06-20 18:58:33,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:33,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 18:58:33,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:33,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 18:58:33,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 18:58:33,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-06-20 18:58:33,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 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 18:58:33,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:33,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-06-20 18:58:33,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:35,742 INFO  L124   PetriNetUnfolderBase]: 1566/2436 cut-off events.
[2024-06-20 18:58:35,742 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-20 18:58:35,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2436 events. 1566/2436 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12309 event pairs, 1097 based on Foata normal form. 1/2362 useless extension candidates. Maximal degree in co-relation 4835. Up to 2326 conditions per place. 
[2024-06-20 18:58:35,762 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 33 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-20 18:58:35,762 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 179 flow
[2024-06-20 18:58:35,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 18:58:35,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 18:58:35,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2024-06-20 18:58:35,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6212121212121212
[2024-06-20 18:58:35,775 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 82 transitions.
[2024-06-20 18:58:35,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 179 flow
[2024-06-20 18:58:35,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 18:58:35,781 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow
[2024-06-20 18:58:35,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-20 18:58:35,786 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places.
[2024-06-20 18:58:35,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow
[2024-06-20 18:58:35,786 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 18:58:35,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:35,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:35,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 18:58:35,790 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:35,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:35,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1477883188, now seen corresponding path program 1 times
[2024-06-20 18:58:35,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:35,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115683418]
[2024-06-20 18:58:35,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:35,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:35,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:44,642 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 18:58:44,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:44,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115683418]
[2024-06-20 18:58:44,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115683418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:44,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:44,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 18:58:44,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028015925]
[2024-06-20 18:58:44,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:44,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 18:58:44,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:44,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 18:58:44,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 18:58:44,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-06-20 18:58:44,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:44,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:44,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-06-20 18:58:44,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:46,286 INFO  L124   PetriNetUnfolderBase]: 1560/2433 cut-off events.
[2024-06-20 18:58:46,286 INFO  L125   PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES.
[2024-06-20 18:58:46,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 2433 events. 1560/2433 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12315 event pairs, 930 based on Foata normal form. 3/2397 useless extension candidates. Maximal degree in co-relation 5437. Up to 2302 conditions per place. 
[2024-06-20 18:58:46,302 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-20 18:58:46,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 246 flow
[2024-06-20 18:58:46,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 18:58:46,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 18:58:46,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions.
[2024-06-20 18:58:46,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6022727272727273
[2024-06-20 18:58:46,307 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 106 transitions.
[2024-06-20 18:58:46,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 246 flow
[2024-06-20 18:58:46,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 18:58:46,311 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow
[2024-06-20 18:58:46,312 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-20 18:58:46,312 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2024-06-20 18:58:46,312 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow
[2024-06-20 18:58:46,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:46,313 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:46,313 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:46,313 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 18:58:46,313 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:46,314 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:46,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388389293, now seen corresponding path program 1 times
[2024-06-20 18:58:46,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:46,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192552967]
[2024-06-20 18:58:46,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:46,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:46,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:54,652 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 18:58:54,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:54,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192552967]
[2024-06-20 18:58:54,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192552967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:54,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:54,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:58:54,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186752692]
[2024-06-20 18:58:54,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:54,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:58:54,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:54,657 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:58:54,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:58:54,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:58:54,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 18:58:54,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:54,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:58:54,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:56,930 INFO  L124   PetriNetUnfolderBase]: 1893/2922 cut-off events.
[2024-06-20 18:58:56,930 INFO  L125   PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES.
[2024-06-20 18:58:56,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 2922 events. 1893/2922 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14776 event pairs, 878 based on Foata normal form. 3/2877 useless extension candidates. Maximal degree in co-relation 7195. Up to 2753 conditions per place. 
[2024-06-20 18:58:56,943 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 55 selfloop transitions, 13 changer transitions 0/75 dead transitions.
[2024-06-20 18:58:56,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 380 flow
[2024-06-20 18:58:56,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:58:56,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:58:56,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions.
[2024-06-20 18:58:56,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5643939393939394
[2024-06-20 18:58:56,946 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 6 states and 149 transitions.
[2024-06-20 18:58:56,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 380 flow
[2024-06-20 18:58:56,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 360 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-20 18:58:56,950 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 200 flow
[2024-06-20 18:58:56,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-20 18:58:56,951 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2024-06-20 18:58:56,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 200 flow
[2024-06-20 18:58:56,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 18:58:56,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:56,952 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:56,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 18:58:56,952 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:56,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:56,953 INFO  L85        PathProgramCache]: Analyzing trace with hash -946889695, now seen corresponding path program 1 times
[2024-06-20 18:58:56,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:56,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365846266]
[2024-06-20 18:58:56,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:56,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:57,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:04,879 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 18:59:04,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:04,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365846266]
[2024-06-20 18:59:04,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365846266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:04,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:04,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:59:04,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319535678]
[2024-06-20 18:59:04,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:04,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:59:04,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:04,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:59:04,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:59:05,223 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-20 18:59:05,225 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 200 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 18:59:05,225 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:05,225 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-20 18:59:05,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:07,338 INFO  L124   PetriNetUnfolderBase]: 1884/2903 cut-off events.
[2024-06-20 18:59:07,339 INFO  L125   PetriNetUnfolderBase]: For 3016/3016 co-relation queries the response was YES.
[2024-06-20 18:59:07,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7974 conditions, 2903 events. 1884/2903 cut-off events. For 3016/3016 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14621 event pairs, 690 based on Foata normal form. 6/2859 useless extension candidates. Maximal degree in co-relation 7958. Up to 2708 conditions per place. 
[2024-06-20 18:59:07,355 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 15 changer transitions 0/81 dead transitions.
[2024-06-20 18:59:07,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 440 flow
[2024-06-20 18:59:07,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:59:07,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:59:07,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-06-20 18:59:07,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-06-20 18:59:07,359 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 200 flow. Second operand 7 states and 168 transitions.
[2024-06-20 18:59:07,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 440 flow
[2024-06-20 18:59:07,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 412 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 18:59:07,367 INFO  L231             Difference]: Finished difference. Result has 56 places, 48 transitions, 221 flow
[2024-06-20 18:59:07,367 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=56, PETRI_TRANSITIONS=48}
[2024-06-20 18:59:07,368 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places.
[2024-06-20 18:59:07,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 221 flow
[2024-06-20 18:59:07,369 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 18:59:07,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:07,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:07,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 18:59:07,370 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:07,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:07,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1725653254, now seen corresponding path program 1 times
[2024-06-20 18:59:07,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:07,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217467219]
[2024-06-20 18:59:07,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:07,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:07,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:24,053 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 18:59:24,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:24,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217467219]
[2024-06-20 18:59:24,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217467219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:24,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:24,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:59:24,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097775289]
[2024-06-20 18:59:24,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:24,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:59:24,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:24,055 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:59:24,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:59:24,216 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 18:59:24,217 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 221 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:59:24,217 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:24,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 18:59:24,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:25,865 INFO  L124   PetriNetUnfolderBase]: 1879/2896 cut-off events.
[2024-06-20 18:59:25,866 INFO  L125   PetriNetUnfolderBase]: For 4612/4612 co-relation queries the response was YES.
[2024-06-20 18:59:25,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8452 conditions, 2896 events. 1879/2896 cut-off events. For 4612/4612 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14550 event pairs, 812 based on Foata normal form. 2/2848 useless extension candidates. Maximal degree in co-relation 8434. Up to 2767 conditions per place. 
[2024-06-20 18:59:25,886 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 48 selfloop transitions, 8 changer transitions 0/62 dead transitions.
[2024-06-20 18:59:25,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 377 flow
[2024-06-20 18:59:25,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:59:25,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:59:25,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions.
[2024-06-20 18:59:25,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4636363636363636
[2024-06-20 18:59:25,889 INFO  L175             Difference]: Start difference. First operand has 56 places, 48 transitions, 221 flow. Second operand 5 states and 102 transitions.
[2024-06-20 18:59:25,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 377 flow
[2024-06-20 18:59:25,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 338 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-20 18:59:25,899 INFO  L231             Difference]: Finished difference. Result has 56 places, 51 transitions, 228 flow
[2024-06-20 18:59:25,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=56, PETRI_TRANSITIONS=51}
[2024-06-20 18:59:25,902 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places.
[2024-06-20 18:59:25,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 228 flow
[2024-06-20 18:59:25,903 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 18:59:25,903 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:25,903 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:25,903 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 18:59:25,904 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:25,904 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:25,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1955641704, now seen corresponding path program 1 times
[2024-06-20 18:59:25,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:25,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486897363]
[2024-06-20 18:59:25,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:25,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:25,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:43,778 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 18:59:43,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:43,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486897363]
[2024-06-20 18:59:43,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486897363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:43,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:43,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:59:43,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861944095]
[2024-06-20 18:59:43,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:43,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:59:43,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:43,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:59:43,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:59:43,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 18:59:43,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 228 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 18:59:43,897 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:43,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 18:59:43,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:45,734 INFO  L124   PetriNetUnfolderBase]: 2215/3407 cut-off events.
[2024-06-20 18:59:45,734 INFO  L125   PetriNetUnfolderBase]: For 7255/7255 co-relation queries the response was YES.
[2024-06-20 18:59:45,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10468 conditions, 3407 events. 2215/3407 cut-off events. For 7255/7255 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17069 event pairs, 972 based on Foata normal form. 2/3399 useless extension candidates. Maximal degree in co-relation 10448. Up to 3242 conditions per place. 
[2024-06-20 18:59:45,752 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 11 changer transitions 0/69 dead transitions.
[2024-06-20 18:59:45,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 414 flow
[2024-06-20 18:59:45,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:59:45,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:59:45,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-20 18:59:45,754 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4356060606060606
[2024-06-20 18:59:45,754 INFO  L175             Difference]: Start difference. First operand has 56 places, 51 transitions, 228 flow. Second operand 6 states and 115 transitions.
[2024-06-20 18:59:45,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 414 flow
[2024-06-20 18:59:45,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 392 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 18:59:45,760 INFO  L231             Difference]: Finished difference. Result has 59 places, 54 transitions, 262 flow
[2024-06-20 18:59:45,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=54}
[2024-06-20 18:59:45,763 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places.
[2024-06-20 18:59:45,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 262 flow
[2024-06-20 18:59:45,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 18:59:45,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:45,764 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:45,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 18:59:45,764 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:45,765 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:45,765 INFO  L85        PathProgramCache]: Analyzing trace with hash 695777733, now seen corresponding path program 1 times
[2024-06-20 18:59:45,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:45,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887135300]
[2024-06-20 18:59:45,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:45,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:45,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:59,244 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 18:59:59,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:59,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887135300]
[2024-06-20 18:59:59,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887135300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:59,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:59,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:59:59,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991429519]
[2024-06-20 18:59:59,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:59,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:59:59,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:59,246 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:59:59,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:59:59,401 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 18:59:59,402 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 262 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:59,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:59,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 18:59:59,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:01,150 INFO  L124   PetriNetUnfolderBase]: 2094/3285 cut-off events.
[2024-06-20 19:00:01,151 INFO  L125   PetriNetUnfolderBase]: For 9839/9839 co-relation queries the response was YES.
[2024-06-20 19:00:01,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10815 conditions, 3285 events. 2094/3285 cut-off events. For 9839/9839 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16955 event pairs, 871 based on Foata normal form. 2/3276 useless extension candidates. Maximal degree in co-relation 10794. Up to 3040 conditions per place. 
[2024-06-20 19:00:01,165 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 60 selfloop transitions, 17 changer transitions 0/84 dead transitions.
[2024-06-20 19:00:01,166 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 544 flow
[2024-06-20 19:00:01,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:01,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:01,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-20 19:00:01,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4675324675324675
[2024-06-20 19:00:01,167 INFO  L175             Difference]: Start difference. First operand has 59 places, 54 transitions, 262 flow. Second operand 7 states and 144 transitions.
[2024-06-20 19:00:01,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 544 flow
[2024-06-20 19:00:01,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 512 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:00:01,172 INFO  L231             Difference]: Finished difference. Result has 62 places, 60 transitions, 322 flow
[2024-06-20 19:00:01,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2024-06-20 19:00:01,173 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places.
[2024-06-20 19:00:01,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 322 flow
[2024-06-20 19:00:01,174 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:01,174 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:01,174 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:01,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:00:01,174 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:01,175 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:01,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -495356967, now seen corresponding path program 2 times
[2024-06-20 19:00:01,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:01,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384965511]
[2024-06-20 19:00:01,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:01,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:01,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:15,403 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:00:15,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:15,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384965511]
[2024-06-20 19:00:15,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384965511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:15,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:15,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:00:15,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208588329]
[2024-06-20 19:00:15,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:15,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:00:15,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:15,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:00:15,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:00:15,567 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:00:15,567 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 322 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:15,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:15,568 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:00:15,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:17,227 INFO  L124   PetriNetUnfolderBase]: 2089/3278 cut-off events.
[2024-06-20 19:00:17,227 INFO  L125   PetriNetUnfolderBase]: For 12804/12804 co-relation queries the response was YES.
[2024-06-20 19:00:17,232 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11513 conditions, 3278 events. 2089/3278 cut-off events. For 12804/12804 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16929 event pairs, 871 based on Foata normal form. 2/3269 useless extension candidates. Maximal degree in co-relation 11491. Up to 3059 conditions per place. 
[2024-06-20 19:00:17,246 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 57 selfloop transitions, 11 changer transitions 0/75 dead transitions.
[2024-06-20 19:00:17,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 496 flow
[2024-06-20 19:00:17,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:00:17,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:00:17,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-20 19:00:17,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-20 19:00:17,250 INFO  L175             Difference]: Start difference. First operand has 62 places, 60 transitions, 322 flow. Second operand 6 states and 120 transitions.
[2024-06-20 19:00:17,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 496 flow
[2024-06-20 19:00:17,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 456 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-20 19:00:17,262 INFO  L231             Difference]: Finished difference. Result has 65 places, 60 transitions, 312 flow
[2024-06-20 19:00:17,262 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=65, PETRI_TRANSITIONS=60}
[2024-06-20 19:00:17,264 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2024-06-20 19:00:17,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 312 flow
[2024-06-20 19:00:17,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:17,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:17,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:17,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:00:17,266 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:17,266 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:17,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -495349031, now seen corresponding path program 1 times
[2024-06-20 19:00:17,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:17,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927744536]
[2024-06-20 19:00:17,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:17,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:17,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:36,009 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:00:36,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:36,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927744536]
[2024-06-20 19:00:36,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927744536] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:36,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:36,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:00:36,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982093337]
[2024-06-20 19:00:36,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:36,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:00:36,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:36,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:00:36,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:00:36,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:00:36,146 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 312 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:36,146 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:36,146 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:00:36,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:38,039 INFO  L124   PetriNetUnfolderBase]: 2211/3382 cut-off events.
[2024-06-20 19:00:38,039 INFO  L125   PetriNetUnfolderBase]: For 14788/14788 co-relation queries the response was YES.
[2024-06-20 19:00:38,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12025 conditions, 3382 events. 2211/3382 cut-off events. For 14788/14788 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16881 event pairs, 909 based on Foata normal form. 4/3373 useless extension candidates. Maximal degree in co-relation 12001. Up to 3219 conditions per place. 
[2024-06-20 19:00:38,054 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 64 selfloop transitions, 14 changer transitions 0/83 dead transitions.
[2024-06-20 19:00:38,054 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 544 flow
[2024-06-20 19:00:38,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:38,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:38,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-20 19:00:38,056 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:00:38,056 INFO  L175             Difference]: Start difference. First operand has 65 places, 60 transitions, 312 flow. Second operand 7 states and 133 transitions.
[2024-06-20 19:00:38,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 544 flow
[2024-06-20 19:00:38,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 510 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-20 19:00:38,064 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 346 flow
[2024-06-20 19:00:38,064 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2024-06-20 19:00:38,065 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places.
[2024-06-20 19:00:38,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 346 flow
[2024-06-20 19:00:38,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:38,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:38,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:38,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:00:38,066 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:38,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:38,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 588551723, now seen corresponding path program 1 times
[2024-06-20 19:00:38,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:38,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229569525]
[2024-06-20 19:00:38,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:38,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:38,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:52,786 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:00:52,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:52,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229569525]
[2024-06-20 19:00:52,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229569525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:52,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:52,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:00:52,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419915982]
[2024-06-20 19:00:52,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:52,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:00:52,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:52,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:00:52,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:00:53,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:00:53,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 346 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:00:53,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:53,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:00:53,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:54,840 INFO  L124   PetriNetUnfolderBase]: 2090/3265 cut-off events.
[2024-06-20 19:00:54,840 INFO  L125   PetriNetUnfolderBase]: For 18151/18151 co-relation queries the response was YES.
[2024-06-20 19:00:54,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12348 conditions, 3265 events. 2090/3265 cut-off events. For 18151/18151 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16754 event pairs, 826 based on Foata normal form. 2/3253 useless extension candidates. Maximal degree in co-relation 12324. Up to 3040 conditions per place. 
[2024-06-20 19:00:54,856 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 70 selfloop transitions, 14 changer transitions 0/91 dead transitions.
[2024-06-20 19:00:54,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 606 flow
[2024-06-20 19:00:54,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:54,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:54,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-20 19:00:54,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4675324675324675
[2024-06-20 19:00:54,857 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 346 flow. Second operand 7 states and 144 transitions.
[2024-06-20 19:00:54,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 606 flow
[2024-06-20 19:00:54,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 562 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 19:00:54,867 INFO  L231             Difference]: Finished difference. Result has 68 places, 66 transitions, 372 flow
[2024-06-20 19:00:54,867 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=68, PETRI_TRANSITIONS=66}
[2024-06-20 19:00:54,867 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places.
[2024-06-20 19:00:54,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 372 flow
[2024-06-20 19:00:54,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:00:54,868 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:54,868 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:54,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:00:54,868 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:54,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:54,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1646673119, now seen corresponding path program 2 times
[2024-06-20 19:00:54,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:54,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087164483]
[2024-06-20 19:00:54,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:54,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:54,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:08,975 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:01:08,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:08,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087164483]
[2024-06-20 19:01:08,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087164483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:08,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:08,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:08,976 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649100109]
[2024-06-20 19:01:08,977 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:08,977 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:08,977 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:08,977 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:08,977 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:09,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:01:09,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 372 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:01:09,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:09,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:01:09,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:10,991 INFO  L124   PetriNetUnfolderBase]: 2101/3281 cut-off events.
[2024-06-20 19:01:10,991 INFO  L125   PetriNetUnfolderBase]: For 22079/22079 co-relation queries the response was YES.
[2024-06-20 19:01:10,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 3281 events. 2101/3281 cut-off events. For 22079/22079 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16882 event pairs, 826 based on Foata normal form. 2/3269 useless extension candidates. Maximal degree in co-relation 13065. Up to 3009 conditions per place. 
[2024-06-20 19:01:11,006 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 66 selfloop transitions, 27 changer transitions 0/100 dead transitions.
[2024-06-20 19:01:11,006 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 736 flow
[2024-06-20 19:01:11,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:01:11,007 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:01:11,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-20 19:01:11,008 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-20 19:01:11,008 INFO  L175             Difference]: Start difference. First operand has 68 places, 66 transitions, 372 flow. Second operand 8 states and 164 transitions.
[2024-06-20 19:01:11,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 736 flow
[2024-06-20 19:01:11,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 690 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 19:01:11,016 INFO  L231             Difference]: Finished difference. Result has 71 places, 72 transitions, 462 flow
[2024-06-20 19:01:11,016 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=71, PETRI_TRANSITIONS=72}
[2024-06-20 19:01:11,017 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places.
[2024-06-20 19:01:11,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 462 flow
[2024-06-20 19:01:11,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:01:11,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:11,017 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:11,017 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:01:11,017 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:11,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:11,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 588671879, now seen corresponding path program 1 times
[2024-06-20 19:01:11,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:11,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209234530]
[2024-06-20 19:01:11,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:11,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:11,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:26,395 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:01:26,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:26,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209234530]
[2024-06-20 19:01:26,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209234530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:26,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:26,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:26,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310885881]
[2024-06-20 19:01:26,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:26,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:26,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:26,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:26,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:26,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:01:26,566 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 462 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:26,566 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:26,566 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:01:26,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:28,338 INFO  L124   PetriNetUnfolderBase]: 2244/3458 cut-off events.
[2024-06-20 19:01:28,339 INFO  L125   PetriNetUnfolderBase]: For 26386/26386 co-relation queries the response was YES.
[2024-06-20 19:01:28,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14360 conditions, 3458 events. 2244/3458 cut-off events. For 26386/26386 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17397 event pairs, 885 based on Foata normal form. 2/3445 useless extension candidates. Maximal degree in co-relation 14334. Up to 3227 conditions per place. 
[2024-06-20 19:01:28,353 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 77 selfloop transitions, 24 changer transitions 0/106 dead transitions.
[2024-06-20 19:01:28,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 838 flow
[2024-06-20 19:01:28,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:01:28,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:01:28,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:01:28,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4460227272727273
[2024-06-20 19:01:28,355 INFO  L175             Difference]: Start difference. First operand has 71 places, 72 transitions, 462 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:01:28,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 838 flow
[2024-06-20 19:01:28,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 792 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-20 19:01:28,369 INFO  L231             Difference]: Finished difference. Result has 75 places, 78 transitions, 538 flow
[2024-06-20 19:01:28,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=75, PETRI_TRANSITIONS=78}
[2024-06-20 19:01:28,370 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places.
[2024-06-20 19:01:28,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 538 flow
[2024-06-20 19:01:28,370 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:28,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:28,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:28,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:01:28,371 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:28,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:28,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 1824041975, now seen corresponding path program 2 times
[2024-06-20 19:01:28,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:28,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435481418]
[2024-06-20 19:01:28,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:28,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:28,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:41,914 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:01:41,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:41,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435481418]
[2024-06-20 19:01:41,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435481418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:41,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:41,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:41,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923974691]
[2024-06-20 19:01:41,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:41,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:41,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:41,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:41,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:42,140 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:01:42,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 538 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:42,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:42,141 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:01:42,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:43,868 INFO  L124   PetriNetUnfolderBase]: 2255/3474 cut-off events.
[2024-06-20 19:01:43,869 INFO  L125   PetriNetUnfolderBase]: For 31001/31001 co-relation queries the response was YES.
[2024-06-20 19:01:43,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15180 conditions, 3474 events. 2255/3474 cut-off events. For 31001/31001 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17503 event pairs, 885 based on Foata normal form. 2/3461 useless extension candidates. Maximal degree in co-relation 15152. Up to 3292 conditions per place. 
[2024-06-20 19:01:43,881 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 14 changer transitions 0/100 dead transitions.
[2024-06-20 19:01:43,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 812 flow
[2024-06-20 19:01:43,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:01:43,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:01:43,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-20 19:01:43,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:01:43,882 INFO  L175             Difference]: Start difference. First operand has 75 places, 78 transitions, 538 flow. Second operand 7 states and 132 transitions.
[2024-06-20 19:01:43,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 812 flow
[2024-06-20 19:01:43,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 100 transitions, 772 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-20 19:01:43,897 INFO  L231             Difference]: Finished difference. Result has 78 places, 81 transitions, 576 flow
[2024-06-20 19:01:43,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=78, PETRI_TRANSITIONS=81}
[2024-06-20 19:01:43,898 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places.
[2024-06-20 19:01:43,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 576 flow
[2024-06-20 19:01:43,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:43,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:43,899 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:43,899 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:01:43,899 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:43,899 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:43,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 100703765, now seen corresponding path program 3 times
[2024-06-20 19:01:43,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:43,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630596058]
[2024-06-20 19:01:43,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:43,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:43,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:58,240 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:01:58,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:58,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630596058]
[2024-06-20 19:01:58,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630596058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:58,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:58,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:58,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844353223]
[2024-06-20 19:01:58,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:58,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:58,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:58,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:58,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:58,422 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:01:58,422 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 576 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:01:58,422 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:58,422 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:01:58,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:00,195 INFO  L124   PetriNetUnfolderBase]: 2125/3342 cut-off events.
[2024-06-20 19:02:00,195 INFO  L125   PetriNetUnfolderBase]: For 34672/34672 co-relation queries the response was YES.
[2024-06-20 19:02:00,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14946 conditions, 3342 events. 2125/3342 cut-off events. For 34672/34672 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17337 event pairs, 820 based on Foata normal form. 2/3329 useless extension candidates. Maximal degree in co-relation 14916. Up to 3088 conditions per place. 
[2024-06-20 19:02:00,208 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 76 selfloop transitions, 14 changer transitions 0/100 dead transitions.
[2024-06-20 19:02:00,209 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 804 flow
[2024-06-20 19:02:00,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:00,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:00,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 19:02:00,210 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44805194805194803
[2024-06-20 19:02:00,210 INFO  L175             Difference]: Start difference. First operand has 78 places, 81 transitions, 576 flow. Second operand 7 states and 138 transitions.
[2024-06-20 19:02:00,210 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 804 flow
[2024-06-20 19:02:00,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 736 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 19:02:00,227 INFO  L231             Difference]: Finished difference. Result has 80 places, 81 transitions, 544 flow
[2024-06-20 19:02:00,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=80, PETRI_TRANSITIONS=81}
[2024-06-20 19:02:00,228 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places.
[2024-06-20 19:02:00,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 544 flow
[2024-06-20 19:02:00,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 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:02:00,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:00,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:00,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:02:00,229 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:00,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:00,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 1823804825, now seen corresponding path program 3 times
[2024-06-20 19:02:00,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:00,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954081120]
[2024-06-20 19:02:00,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:00,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:00,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:13,890 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:02:13,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:13,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954081120]
[2024-06-20 19:02:13,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954081120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:13,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:13,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:13,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655238565]
[2024-06-20 19:02:13,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:13,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:13,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:13,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:13,892 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:14,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:02:14,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 544 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:14,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:14,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:02:14,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:15,861 INFO  L124   PetriNetUnfolderBase]: 2245/3460 cut-off events.
[2024-06-20 19:02:15,861 INFO  L125   PetriNetUnfolderBase]: For 38416/38416 co-relation queries the response was YES.
[2024-06-20 19:02:15,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15677 conditions, 3460 events. 2245/3460 cut-off events. For 38416/38416 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17407 event pairs, 885 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 15646. Up to 3260 conditions per place. 
[2024-06-20 19:02:15,876 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 76 selfloop transitions, 19 changer transitions 0/100 dead transitions.
[2024-06-20 19:02:15,876 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 782 flow
[2024-06-20 19:02:15,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:15,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:15,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-20 19:02:15,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-20 19:02:15,877 INFO  L175             Difference]: Start difference. First operand has 80 places, 81 transitions, 544 flow. Second operand 7 states and 134 transitions.
[2024-06-20 19:02:15,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 782 flow
[2024-06-20 19:02:15,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 722 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 19:02:15,900 INFO  L231             Difference]: Finished difference. Result has 81 places, 81 transitions, 530 flow
[2024-06-20 19:02:15,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=81, PETRI_TRANSITIONS=81}
[2024-06-20 19:02:15,900 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places.
[2024-06-20 19:02:15,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 530 flow
[2024-06-20 19:02:15,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:15,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:15,901 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:15,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:02:15,901 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:15,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:15,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 752899345, now seen corresponding path program 1 times
[2024-06-20 19:02:15,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:15,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527555393]
[2024-06-20 19:02:15,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:15,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:15,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:35,862 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:02:35,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:35,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527555393]
[2024-06-20 19:02:35,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527555393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:35,862 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:35,862 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:02:35,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716155499]
[2024-06-20 19:02:35,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:35,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:02:35,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:35,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:02:35,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:02:36,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:02:36,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 530 flow. Second operand  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:02:36,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:36,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:02:36,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:37,960 INFO  L124   PetriNetUnfolderBase]: 2285/3634 cut-off events.
[2024-06-20 19:02:37,961 INFO  L125   PetriNetUnfolderBase]: For 48108/48108 co-relation queries the response was YES.
[2024-06-20 19:02:37,968 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 3634 events. 2285/3634 cut-off events. For 48108/48108 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19034 event pairs, 997 based on Foata normal form. 1/3633 useless extension candidates. Maximal degree in co-relation 16733. Up to 3360 conditions per place. 
[2024-06-20 19:02:37,978 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 68 selfloop transitions, 8 changer transitions 0/92 dead transitions.
[2024-06-20 19:02:37,978 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 724 flow
[2024-06-20 19:02:37,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:02:37,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:02:37,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions.
[2024-06-20 19:02:37,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44545454545454544
[2024-06-20 19:02:37,979 INFO  L175             Difference]: Start difference. First operand has 81 places, 81 transitions, 530 flow. Second operand 5 states and 98 transitions.
[2024-06-20 19:02:37,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 724 flow
[2024-06-20 19:02:37,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 92 transitions, 662 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 19:02:37,997 INFO  L231             Difference]: Finished difference. Result has 80 places, 84 transitions, 518 flow
[2024-06-20 19:02:37,998 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=80, PETRI_TRANSITIONS=84}
[2024-06-20 19:02:37,998 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places.
[2024-06-20 19:02:37,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 518 flow
[2024-06-20 19:02:37,999 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:02:37,999 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:37,999 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:37,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:02:37,999 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:38,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:38,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065145482, now seen corresponding path program 1 times
[2024-06-20 19:02:38,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:38,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993196227]
[2024-06-20 19:02:38,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:38,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:38,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:53,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:53,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:53,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993196227]
[2024-06-20 19:02:53,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993196227] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:53,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:53,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:02:53,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518953454]
[2024-06-20 19:02:53,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:53,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:02:53,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:53,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:02:53,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:02:53,744 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:02:53,745 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 518 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:53,745 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:53,745 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:02:53,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:55,727 INFO  L124   PetriNetUnfolderBase]: 2144/3369 cut-off events.
[2024-06-20 19:02:55,728 INFO  L125   PetriNetUnfolderBase]: For 47404/47404 co-relation queries the response was YES.
[2024-06-20 19:02:55,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16217 conditions, 3369 events. 2144/3369 cut-off events. For 47404/47404 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17371 event pairs, 798 based on Foata normal form. 2/3369 useless extension candidates. Maximal degree in co-relation 16184. Up to 3071 conditions per place. 
[2024-06-20 19:02:55,741 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 95 selfloop transitions, 23 changer transitions 0/128 dead transitions.
[2024-06-20 19:02:55,741 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 988 flow
[2024-06-20 19:02:55,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:02:55,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:02:55,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-20 19:02:55,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4696969696969697
[2024-06-20 19:02:55,743 INFO  L175             Difference]: Start difference. First operand has 80 places, 84 transitions, 518 flow. Second operand 9 states and 186 transitions.
[2024-06-20 19:02:55,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 988 flow
[2024-06-20 19:02:55,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 960 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:02:55,758 INFO  L231             Difference]: Finished difference. Result has 86 places, 90 transitions, 626 flow
[2024-06-20 19:02:55,758 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=626, PETRI_PLACES=86, PETRI_TRANSITIONS=90}
[2024-06-20 19:02:55,759 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places.
[2024-06-20 19:02:55,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 626 flow
[2024-06-20 19:02:55,759 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:55,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:55,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:55,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:02:55,760 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:55,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:55,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 340991635, now seen corresponding path program 1 times
[2024-06-20 19:02:55,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:55,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343688828]
[2024-06-20 19:02:55,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:55,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:55,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:10,743 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:03:10,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:10,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343688828]
[2024-06-20 19:03:10,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343688828] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:10,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:10,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:03:10,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071944331]
[2024-06-20 19:03:10,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:10,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:03:10,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:10,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:03:10,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:03:10,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:10,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 626 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:03:10,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:10,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:10,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:12,894 INFO  L124   PetriNetUnfolderBase]: 2280/3509 cut-off events.
[2024-06-20 19:03:12,894 INFO  L125   PetriNetUnfolderBase]: For 54042/54042 co-relation queries the response was YES.
[2024-06-20 19:03:12,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17597 conditions, 3509 events. 2280/3509 cut-off events. For 54042/54042 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17582 event pairs, 842 based on Foata normal form. 2/3509 useless extension candidates. Maximal degree in co-relation 17563. Up to 3308 conditions per place. 
[2024-06-20 19:03:12,910 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 100 selfloop transitions, 17 changer transitions 0/122 dead transitions.
[2024-06-20 19:03:12,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 122 transitions, 974 flow
[2024-06-20 19:03:12,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:03:12,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:03:12,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-20 19:03:12,912 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4403409090909091
[2024-06-20 19:03:12,912 INFO  L175             Difference]: Start difference. First operand has 86 places, 90 transitions, 626 flow. Second operand 8 states and 155 transitions.
[2024-06-20 19:03:12,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 122 transitions, 974 flow
[2024-06-20 19:03:12,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 122 transitions, 914 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-20 19:03:12,934 INFO  L231             Difference]: Finished difference. Result has 89 places, 93 transitions, 654 flow
[2024-06-20 19:03:12,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=89, PETRI_TRANSITIONS=93}
[2024-06-20 19:03:12,935 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places.
[2024-06-20 19:03:12,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 654 flow
[2024-06-20 19:03:12,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:03:12,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:12,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:12,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:03:12,936 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:12,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:12,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065235692, now seen corresponding path program 2 times
[2024-06-20 19:03:12,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:12,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142883232]
[2024-06-20 19:03:12,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:12,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:12,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:29,780 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:03:29,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:29,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142883232]
[2024-06-20 19:03:29,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142883232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:29,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:29,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:03:29,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151795174]
[2024-06-20 19:03:29,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:29,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:03:29,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:29,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:03:29,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:03:30,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:03:30,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 654 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:30,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:30,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:03:30,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:32,082 INFO  L124   PetriNetUnfolderBase]: 2157/3384 cut-off events.
[2024-06-20 19:03:32,082 INFO  L125   PetriNetUnfolderBase]: For 60007/60007 co-relation queries the response was YES.
[2024-06-20 19:03:32,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17629 conditions, 3384 events. 2157/3384 cut-off events. For 60007/60007 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17416 event pairs, 792 based on Foata normal form. 2/3384 useless extension candidates. Maximal degree in co-relation 17593. Up to 3106 conditions per place. 
[2024-06-20 19:03:32,099 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 94 selfloop transitions, 17 changer transitions 0/122 dead transitions.
[2024-06-20 19:03:32,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 122 transitions, 950 flow
[2024-06-20 19:03:32,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:03:32,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:03:32,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 19:03:32,104 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4602272727272727
[2024-06-20 19:03:32,104 INFO  L175             Difference]: Start difference. First operand has 89 places, 93 transitions, 654 flow. Second operand 8 states and 162 transitions.
[2024-06-20 19:03:32,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 122 transitions, 950 flow
[2024-06-20 19:03:32,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 122 transitions, 868 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-20 19:03:32,133 INFO  L231             Difference]: Finished difference. Result has 91 places, 93 transitions, 614 flow
[2024-06-20 19:03:32,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=91, PETRI_TRANSITIONS=93}
[2024-06-20 19:03:32,133 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places.
[2024-06-20 19:03:32,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 614 flow
[2024-06-20 19:03:32,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:32,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:32,134 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:32,134 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:03:32,134 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:32,135 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:32,135 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068960714, now seen corresponding path program 1 times
[2024-06-20 19:03:32,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:32,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478978887]
[2024-06-20 19:03:32,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:32,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:32,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:47,099 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:03:47,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:47,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478978887]
[2024-06-20 19:03:47,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478978887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:47,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:47,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:03:47,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364443750]
[2024-06-20 19:03:47,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:47,100 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:03:47,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:47,100 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:03:47,101 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:03:47,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:03:47,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 614 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:03:47,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:47,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:03:47,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:49,250 INFO  L124   PetriNetUnfolderBase]: 2313/3560 cut-off events.
[2024-06-20 19:03:49,250 INFO  L125   PetriNetUnfolderBase]: For 66947/66947 co-relation queries the response was YES.
[2024-06-20 19:03:49,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18763 conditions, 3560 events. 2313/3560 cut-off events. For 66947/66947 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17816 event pairs, 784 based on Foata normal form. 4/3562 useless extension candidates. Maximal degree in co-relation 18726. Up to 3265 conditions per place. 
[2024-06-20 19:03:49,266 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 98 selfloop transitions, 33 changer transitions 0/136 dead transitions.
[2024-06-20 19:03:49,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 136 transitions, 1120 flow
[2024-06-20 19:03:49,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:03:49,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:03:49,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 19:03:49,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494949494949495
[2024-06-20 19:03:49,269 INFO  L175             Difference]: Start difference. First operand has 91 places, 93 transitions, 614 flow. Second operand 9 states and 178 transitions.
[2024-06-20 19:03:49,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 136 transitions, 1120 flow
[2024-06-20 19:03:49,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1078 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 19:03:49,303 INFO  L231             Difference]: Finished difference. Result has 94 places, 102 transitions, 752 flow
[2024-06-20 19:03:49,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=752, PETRI_PLACES=94, PETRI_TRANSITIONS=102}
[2024-06-20 19:03:49,303 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places.
[2024-06-20 19:03:49,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 752 flow
[2024-06-20 19:03:49,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:03:49,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:49,304 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:49,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:03:49,304 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:49,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:49,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068960497, now seen corresponding path program 2 times
[2024-06-20 19:03:49,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:49,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571674405]
[2024-06-20 19:03:49,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:49,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:49,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:04,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:04:04,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:04,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571674405]
[2024-06-20 19:04:04,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571674405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:04,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:04,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:04,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951808183]
[2024-06-20 19:04:04,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:04,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:04,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:04,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:04,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:04,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:04,611 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 752 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:04,611 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:04,611 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:04,611 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:06,521 INFO  L124   PetriNetUnfolderBase]: 2340/3599 cut-off events.
[2024-06-20 19:04:06,521 INFO  L125   PetriNetUnfolderBase]: For 74892/74892 co-relation queries the response was YES.
[2024-06-20 19:04:06,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19988 conditions, 3599 events. 2340/3599 cut-off events. For 74892/74892 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18020 event pairs, 802 based on Foata normal form. 2/3599 useless extension candidates. Maximal degree in co-relation 19949. Up to 3273 conditions per place. 
[2024-06-20 19:04:06,541 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 95 selfloop transitions, 45 changer transitions 0/145 dead transitions.
[2024-06-20 19:04:06,541 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 145 transitions, 1416 flow
[2024-06-20 19:04:06,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:04:06,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:04:06,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 19:04:06,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-20 19:04:06,542 INFO  L175             Difference]: Start difference. First operand has 94 places, 102 transitions, 752 flow. Second operand 9 states and 179 transitions.
[2024-06-20 19:04:06,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 145 transitions, 1416 flow
[2024-06-20 19:04:06,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 145 transitions, 1370 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 19:04:06,576 INFO  L231             Difference]: Finished difference. Result has 99 places, 111 transitions, 954 flow
[2024-06-20 19:04:06,576 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=954, PETRI_PLACES=99, PETRI_TRANSITIONS=111}
[2024-06-20 19:04:06,576 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places.
[2024-06-20 19:04:06,576 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 954 flow
[2024-06-20 19:04:06,577 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:06,577 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:06,577 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:06,577 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:04:06,577 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:06,578 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:06,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -492739400, now seen corresponding path program 3 times
[2024-06-20 19:04:06,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:06,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233609494]
[2024-06-20 19:04:06,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:06,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:06,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:24,164 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:04:24,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:24,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233609494]
[2024-06-20 19:04:24,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233609494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:24,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:24,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:24,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318216407]
[2024-06-20 19:04:24,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:24,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:24,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:24,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:24,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:24,395 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:04:24,396 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 954 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:24,396 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:24,396 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:04:24,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:26,317 INFO  L124   PetriNetUnfolderBase]: 2229/3493 cut-off events.
[2024-06-20 19:04:26,317 INFO  L125   PetriNetUnfolderBase]: For 82887/82887 co-relation queries the response was YES.
[2024-06-20 19:04:26,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20178 conditions, 3493 events. 2229/3493 cut-off events. For 82887/82887 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17970 event pairs, 752 based on Foata normal form. 2/3493 useless extension candidates. Maximal degree in co-relation 20137. Up to 3155 conditions per place. 
[2024-06-20 19:04:26,337 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 100 selfloop transitions, 30 changer transitions 0/144 dead transitions.
[2024-06-20 19:04:26,337 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 144 transitions, 1340 flow
[2024-06-20 19:04:26,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:04:26,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:04:26,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-20 19:04:26,338 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-20 19:04:26,338 INFO  L175             Difference]: Start difference. First operand has 99 places, 111 transitions, 954 flow. Second operand 9 states and 180 transitions.
[2024-06-20 19:04:26,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 144 transitions, 1340 flow
[2024-06-20 19:04:26,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 144 transitions, 1268 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-06-20 19:04:26,375 INFO  L231             Difference]: Finished difference. Result has 104 places, 114 transitions, 1006 flow
[2024-06-20 19:04:26,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1006, PETRI_PLACES=104, PETRI_TRANSITIONS=114}
[2024-06-20 19:04:26,376 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places.
[2024-06-20 19:04:26,376 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 1006 flow
[2024-06-20 19:04:26,376 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:04:26,376 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:26,376 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:26,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:04:26,377 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:26,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:26,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -492739245, now seen corresponding path program 3 times
[2024-06-20 19:04:26,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:26,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38044695]
[2024-06-20 19:04:26,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:26,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:26,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:41,243 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:04:41,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:41,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38044695]
[2024-06-20 19:04:41,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38044695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:41,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:41,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:41,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873869130]
[2024-06-20 19:04:41,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:41,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:41,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:41,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:41,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:41,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:41,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 1006 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:41,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:41,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:41,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:43,376 INFO  L124   PetriNetUnfolderBase]: 2346/3608 cut-off events.
[2024-06-20 19:04:43,376 INFO  L125   PetriNetUnfolderBase]: For 90702/90702 co-relation queries the response was YES.
[2024-06-20 19:04:43,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21513 conditions, 3608 events. 2346/3608 cut-off events. For 90702/90702 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18043 event pairs, 802 based on Foata normal form. 2/3608 useless extension candidates. Maximal degree in co-relation 21470. Up to 3284 conditions per place. 
[2024-06-20 19:04:43,397 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 97 selfloop transitions, 44 changer transitions 0/146 dead transitions.
[2024-06-20 19:04:43,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 146 transitions, 1454 flow
[2024-06-20 19:04:43,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:04:43,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:04:43,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 19:04:43,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494949494949495
[2024-06-20 19:04:43,398 INFO  L175             Difference]: Start difference. First operand has 104 places, 114 transitions, 1006 flow. Second operand 9 states and 178 transitions.
[2024-06-20 19:04:43,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 146 transitions, 1454 flow
[2024-06-20 19:04:43,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 146 transitions, 1332 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-20 19:04:43,444 INFO  L231             Difference]: Finished difference. Result has 106 places, 114 transitions, 980 flow
[2024-06-20 19:04:43,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=980, PETRI_PLACES=106, PETRI_TRANSITIONS=114}
[2024-06-20 19:04:43,445 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 61 predicate places.
[2024-06-20 19:04:43,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 980 flow
[2024-06-20 19:04:43,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:43,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:43,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:43,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:04:43,445 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:43,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:43,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 710728026, now seen corresponding path program 2 times
[2024-06-20 19:04:43,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:43,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738552896]
[2024-06-20 19:04:43,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:43,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:43,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:04:57,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:04:57,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:04:57,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738552896]
[2024-06-20 19:04:57,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738552896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:04:57,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:04:57,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:04:57,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710789543]
[2024-06-20 19:04:57,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:04:57,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:04:57,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:04:57,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:04:57,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:04:57,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:04:57,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 980 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:57,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:04:57,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:04:57,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:04:59,707 INFO  L124   PetriNetUnfolderBase]: 2400/3691 cut-off events.
[2024-06-20 19:04:59,708 INFO  L125   PetriNetUnfolderBase]: For 99720/99720 co-relation queries the response was YES.
[2024-06-20 19:04:59,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22307 conditions, 3691 events. 2400/3691 cut-off events. For 99720/99720 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18560 event pairs, 804 based on Foata normal form. 4/3693 useless extension candidates. Maximal degree in co-relation 22263. Up to 3452 conditions per place. 
[2024-06-20 19:04:59,727 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 120 selfloop transitions, 22 changer transitions 0/147 dead transitions.
[2024-06-20 19:04:59,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1512 flow
[2024-06-20 19:04:59,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:04:59,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:04:59,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-20 19:04:59,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4403409090909091
[2024-06-20 19:04:59,729 INFO  L175             Difference]: Start difference. First operand has 106 places, 114 transitions, 980 flow. Second operand 8 states and 155 transitions.
[2024-06-20 19:04:59,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1512 flow
[2024-06-20 19:04:59,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 147 transitions, 1404 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-20 19:04:59,779 INFO  L231             Difference]: Finished difference. Result has 106 places, 120 transitions, 1018 flow
[2024-06-20 19:04:59,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1018, PETRI_PLACES=106, PETRI_TRANSITIONS=120}
[2024-06-20 19:04:59,779 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 61 predicate places.
[2024-06-20 19:04:59,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 120 transitions, 1018 flow
[2024-06-20 19:04:59,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:04:59,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:04:59,780 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:04:59,780 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:04:59,780 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:04:59,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:04:59,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 703376159, now seen corresponding path program 4 times
[2024-06-20 19:04:59,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:04:59,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409697869]
[2024-06-20 19:04:59,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:04:59,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:04:59,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:15,247 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:05:15,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:15,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409697869]
[2024-06-20 19:05:15,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409697869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:15,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:15,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:15,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301206155]
[2024-06-20 19:05:15,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:15,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:15,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:15,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:15,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:15,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:05:15,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 120 transitions, 1018 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:05:15,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:15,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:05:15,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:17,439 INFO  L124   PetriNetUnfolderBase]: 2427/3730 cut-off events.
[2024-06-20 19:05:17,440 INFO  L125   PetriNetUnfolderBase]: For 107615/107615 co-relation queries the response was YES.
[2024-06-20 19:05:17,449 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22884 conditions, 3730 events. 2427/3730 cut-off events. For 107615/107615 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18709 event pairs, 804 based on Foata normal form. 2/3730 useless extension candidates. Maximal degree in co-relation 22839. Up to 3484 conditions per place. 
[2024-06-20 19:05:17,461 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 119 selfloop transitions, 29 changer transitions 0/153 dead transitions.
[2024-06-20 19:05:17,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 1676 flow
[2024-06-20 19:05:17,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:17,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:17,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:05:17,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4460227272727273
[2024-06-20 19:05:17,463 INFO  L175             Difference]: Start difference. First operand has 106 places, 120 transitions, 1018 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:05:17,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 1676 flow
[2024-06-20 19:05:17,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 153 transitions, 1618 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-20 19:05:17,522 INFO  L231             Difference]: Finished difference. Result has 110 places, 126 transitions, 1134 flow
[2024-06-20 19:05:17,522 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1134, PETRI_PLACES=110, PETRI_TRANSITIONS=126}
[2024-06-20 19:05:17,523 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places.
[2024-06-20 19:05:17,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1134 flow
[2024-06-20 19:05:17,523 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:05:17,523 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:17,523 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:17,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:05:17,524 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:05:17,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:17,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 703376376, now seen corresponding path program 3 times
[2024-06-20 19:05:17,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:17,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637613821]
[2024-06-20 19:05:17,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:17,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:17,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:32,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:32,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:32,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637613821]
[2024-06-20 19:05:32,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637613821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:32,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:32,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:32,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697878835]
[2024-06-20 19:05:32,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:32,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:32,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:32,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:32,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:32,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:05:32,264 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1134 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:05:32,264 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:32,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:05:32,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:34,208 INFO  L124   PetriNetUnfolderBase]: 2417/3716 cut-off events.
[2024-06-20 19:05:34,208 INFO  L125   PetriNetUnfolderBase]: For 113950/113950 co-relation queries the response was YES.
[2024-06-20 19:05:34,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23034 conditions, 3716 events. 2417/3716 cut-off events. For 113950/113950 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18659 event pairs, 802 based on Foata normal form. 4/3718 useless extension candidates. Maximal degree in co-relation 22987. Up to 3441 conditions per place. 
[2024-06-20 19:05:34,230 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 119 selfloop transitions, 29 changer transitions 0/153 dead transitions.
[2024-06-20 19:05:34,230 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 153 transitions, 1598 flow
[2024-06-20 19:05:34,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:34,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:34,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:05:34,231 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4460227272727273
[2024-06-20 19:05:34,231 INFO  L175             Difference]: Start difference. First operand has 110 places, 126 transitions, 1134 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:05:34,231 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 153 transitions, 1598 flow
[2024-06-20 19:05:34,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 153 transitions, 1488 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-20 19:05:34,280 INFO  L231             Difference]: Finished difference. Result has 113 places, 126 transitions, 1090 flow
[2024-06-20 19:05:34,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1090, PETRI_PLACES=113, PETRI_TRANSITIONS=126}
[2024-06-20 19:05:34,280 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places.
[2024-06-20 19:05:34,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 1090 flow
[2024-06-20 19:05:34,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:05:34,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:34,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:34,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:05:34,281 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:05:34,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:34,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 703370424, now seen corresponding path program 4 times
[2024-06-20 19:05:34,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:34,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58293774]
[2024-06-20 19:05:34,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:34,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:34,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:05:49,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:05:49,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:05:49,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58293774]
[2024-06-20 19:05:49,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58293774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:05:49,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:05:49,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:05:49,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755373595]
[2024-06-20 19:05:49,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:05:49,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:05:49,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:05:49,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:05:49,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:05:49,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:05:49,944 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 1090 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:05:49,944 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:05:49,944 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:05:49,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:05:51,869 INFO  L124   PetriNetUnfolderBase]: 2286/3583 cut-off events.
[2024-06-20 19:05:51,869 INFO  L125   PetriNetUnfolderBase]: For 119671/119671 co-relation queries the response was YES.
[2024-06-20 19:05:51,878 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22494 conditions, 3583 events. 2286/3583 cut-off events. For 119671/119671 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18507 event pairs, 752 based on Foata normal form. 2/3583 useless extension candidates. Maximal degree in co-relation 22446. Up to 3287 conditions per place. 
[2024-06-20 19:05:51,889 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 119 selfloop transitions, 17 changer transitions 0/152 dead transitions.
[2024-06-20 19:05:51,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 152 transitions, 1476 flow
[2024-06-20 19:05:51,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:05:51,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:05:51,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 19:05:51,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2024-06-20 19:05:51,890 INFO  L175             Difference]: Start difference. First operand has 113 places, 126 transitions, 1090 flow. Second operand 8 states and 156 transitions.
[2024-06-20 19:05:51,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 152 transitions, 1476 flow
[2024-06-20 19:05:51,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 152 transitions, 1346 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-20 19:05:51,943 INFO  L231             Difference]: Finished difference. Result has 113 places, 129 transitions, 1064 flow
[2024-06-20 19:05:51,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1064, PETRI_PLACES=113, PETRI_TRANSITIONS=129}
[2024-06-20 19:05:51,943 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places.
[2024-06-20 19:05:51,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 129 transitions, 1064 flow
[2024-06-20 19:05:51,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:05:51,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:05:51,944 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:05:51,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:05:51,944 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:05:51,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:05:51,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212845447, now seen corresponding path program 5 times
[2024-06-20 19:05:51,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:05:51,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818968509]
[2024-06-20 19:05:51,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:05:51,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:05:52,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:06,613 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:06:06,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:06,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818968509]
[2024-06-20 19:06:06,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818968509] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:06,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:06,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:06,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536740998]
[2024-06-20 19:06:06,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:06,615 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:06,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:06,615 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:06,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:06,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:06:06,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 129 transitions, 1064 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:06,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:06,854 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:06:06,854 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:08,834 INFO  L124   PetriNetUnfolderBase]: 2407/3702 cut-off events.
[2024-06-20 19:06:08,834 INFO  L125   PetriNetUnfolderBase]: For 128198/128198 co-relation queries the response was YES.
[2024-06-20 19:06:08,844 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23534 conditions, 3702 events. 2407/3702 cut-off events. For 128198/128198 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18560 event pairs, 802 based on Foata normal form. 2/3702 useless extension candidates. Maximal degree in co-relation 23486. Up to 3458 conditions per place. 
[2024-06-20 19:06:08,856 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 119 selfloop transitions, 30 changer transitions 0/154 dead transitions.
[2024-06-20 19:06:08,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 154 transitions, 1530 flow
[2024-06-20 19:06:08,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:06:08,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:06:08,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-20 19:06:08,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:06:08,858 INFO  L175             Difference]: Start difference. First operand has 113 places, 129 transitions, 1064 flow. Second operand 8 states and 154 transitions.
[2024-06-20 19:06:08,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 154 transitions, 1530 flow
[2024-06-20 19:06:08,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 154 transitions, 1422 flow, removed 39 selfloop flow, removed 6 redundant places.
[2024-06-20 19:06:08,922 INFO  L231             Difference]: Finished difference. Result has 115 places, 129 transitions, 1024 flow
[2024-06-20 19:06:08,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1024, PETRI_PLACES=115, PETRI_TRANSITIONS=129}
[2024-06-20 19:06:08,923 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places.
[2024-06-20 19:06:08,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 129 transitions, 1024 flow
[2024-06-20 19:06:08,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:08,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:08,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:08,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:06:08,924 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:06:08,925 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:08,925 INFO  L85        PathProgramCache]: Analyzing trace with hash 710727809, now seen corresponding path program 6 times
[2024-06-20 19:06:08,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:08,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29484771]
[2024-06-20 19:06:08,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:08,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:08,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:23,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:06:23,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:23,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29484771]
[2024-06-20 19:06:23,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29484771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:23,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:23,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:23,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201198091]
[2024-06-20 19:06:23,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:23,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:23,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:23,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:23,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:24,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:06:24,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 129 transitions, 1024 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:24,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:24,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:06:24,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:26,093 INFO  L124   PetriNetUnfolderBase]: 2402/3695 cut-off events.
[2024-06-20 19:06:26,093 INFO  L125   PetriNetUnfolderBase]: For 135304/135304 co-relation queries the response was YES.
[2024-06-20 19:06:26,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23690 conditions, 3695 events. 2402/3695 cut-off events. For 135304/135304 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18544 event pairs, 802 based on Foata normal form. 2/3695 useless extension candidates. Maximal degree in co-relation 23641. Up to 3498 conditions per place. 
[2024-06-20 19:06:26,116 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 130 selfloop transitions, 17 changer transitions 0/152 dead transitions.
[2024-06-20 19:06:26,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 1376 flow
[2024-06-20 19:06:26,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:06:26,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:06:26,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 19:06:26,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42329545454545453
[2024-06-20 19:06:26,117 INFO  L175             Difference]: Start difference. First operand has 115 places, 129 transitions, 1024 flow. Second operand 8 states and 149 transitions.
[2024-06-20 19:06:26,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 1376 flow
[2024-06-20 19:06:26,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 152 transitions, 1282 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-20 19:06:26,176 INFO  L231             Difference]: Finished difference. Result has 117 places, 129 transitions, 972 flow
[2024-06-20 19:06:26,176 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=972, PETRI_PLACES=117, PETRI_TRANSITIONS=129}
[2024-06-20 19:06:26,176 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places.
[2024-06-20 19:06:26,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 129 transitions, 972 flow
[2024-06-20 19:06:26,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:26,177 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:26,177 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:26,177 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:06:26,177 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:06:26,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:26,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 710994936, now seen corresponding path program 4 times
[2024-06-20 19:06:26,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:26,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094671982]
[2024-06-20 19:06:26,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:26,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:26,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:06:40,048 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:06:40,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:06:40,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094671982]
[2024-06-20 19:06:40,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094671982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:06:40,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:06:40,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:06:40,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172875240]
[2024-06-20 19:06:40,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:06:40,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:06:40,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:06:40,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:06:40,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:06:40,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:06:40,263 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 129 transitions, 972 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:40,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:06:40,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:06:40,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:06:42,163 INFO  L124   PetriNetUnfolderBase]: 2392/3681 cut-off events.
[2024-06-20 19:06:42,163 INFO  L125   PetriNetUnfolderBase]: For 142769/142769 co-relation queries the response was YES.
[2024-06-20 19:06:42,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23729 conditions, 3681 events. 2392/3681 cut-off events. For 142769/142769 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18490 event pairs, 800 based on Foata normal form. 4/3683 useless extension candidates. Maximal degree in co-relation 23679. Up to 3475 conditions per place. 
[2024-06-20 19:06:42,185 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 131 selfloop transitions, 17 changer transitions 0/153 dead transitions.
[2024-06-20 19:06:42,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 153 transitions, 1330 flow
[2024-06-20 19:06:42,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:06:42,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:06:42,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:06:42,186 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42613636363636365
[2024-06-20 19:06:42,186 INFO  L175             Difference]: Start difference. First operand has 117 places, 129 transitions, 972 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:06:42,186 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 153 transitions, 1330 flow
[2024-06-20 19:06:42,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 153 transitions, 1252 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-20 19:06:42,235 INFO  L231             Difference]: Finished difference. Result has 117 places, 129 transitions, 936 flow
[2024-06-20 19:06:42,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=936, PETRI_PLACES=117, PETRI_TRANSITIONS=129}
[2024-06-20 19:06:42,236 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places.
[2024-06-20 19:06:42,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 129 transitions, 936 flow
[2024-06-20 19:06:42,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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:06:42,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:06:42,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:06:42,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:06:42,237 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:06:42,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:06:42,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 1817676521, now seen corresponding path program 1 times
[2024-06-20 19:06:42,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:06:42,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574714221]
[2024-06-20 19:06:42,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:06:42,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:06:42,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:04,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:04,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:04,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574714221]
[2024-06-20 19:07:04,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574714221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:04,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:04,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:07:04,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547717471]
[2024-06-20 19:07:04,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:04,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:07:04,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:04,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:07:04,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:07:04,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:04,429 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 129 transitions, 936 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:04,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:04,429 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:04,429 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:06,697 INFO  L124   PetriNetUnfolderBase]: 2720/4164 cut-off events.
[2024-06-20 19:07:06,697 INFO  L125   PetriNetUnfolderBase]: For 193575/193575 co-relation queries the response was YES.
[2024-06-20 19:07:06,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28053 conditions, 4164 events. 2720/4164 cut-off events. For 193575/193575 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 21039 event pairs, 1070 based on Foata normal form. 1/4163 useless extension candidates. Maximal degree in co-relation 28002. Up to 3973 conditions per place. 
[2024-06-20 19:07:06,725 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 105 selfloop transitions, 11 changer transitions 0/141 dead transitions.
[2024-06-20 19:07:06,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 141 transitions, 1216 flow
[2024-06-20 19:07:06,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:07:06,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:07:06,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-20 19:07:06,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4090909090909091
[2024-06-20 19:07:06,726 INFO  L175             Difference]: Start difference. First operand has 117 places, 129 transitions, 936 flow. Second operand 6 states and 108 transitions.
[2024-06-20 19:07:06,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 141 transitions, 1216 flow
[2024-06-20 19:07:06,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 141 transitions, 1172 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 19:07:06,781 INFO  L231             Difference]: Finished difference. Result has 116 places, 132 transitions, 952 flow
[2024-06-20 19:07:06,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=116, PETRI_TRANSITIONS=132}
[2024-06-20 19:07:06,782 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places.
[2024-06-20 19:07:06,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 132 transitions, 952 flow
[2024-06-20 19:07:06,782 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:06,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:06,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:06,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:07:06,782 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:07:06,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:06,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -1340287382, now seen corresponding path program 1 times
[2024-06-20 19:07:06,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:06,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34929778]
[2024-06-20 19:07:06,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:06,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:06,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:22,645 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:07:22,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:22,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34929778]
[2024-06-20 19:07:22,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34929778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:22,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:22,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:07:22,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607196406]
[2024-06-20 19:07:22,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:22,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:07:22,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:22,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:07:22,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:07:23,057 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:07:23,057 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 132 transitions, 952 flow. Second operand  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:07:23,057 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:23,057 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:07:23,057 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:25,334 INFO  L124   PetriNetUnfolderBase]: 2383/3712 cut-off events.
[2024-06-20 19:07:25,335 INFO  L125   PetriNetUnfolderBase]: For 184923/184923 co-relation queries the response was YES.
[2024-06-20 19:07:25,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26103 conditions, 3712 events. 2383/3712 cut-off events. For 184923/184923 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19275 event pairs, 590 based on Foata normal form. 4/3714 useless extension candidates. Maximal degree in co-relation 26051. Up to 3289 conditions per place. 
[2024-06-20 19:07:25,358 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 135 selfloop transitions, 28 changer transitions 0/180 dead transitions.
[2024-06-20 19:07:25,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 180 transitions, 1612 flow
[2024-06-20 19:07:25,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:07:25,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:07:25,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-20 19:07:25,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-20 19:07:25,362 INFO  L175             Difference]: Start difference. First operand has 116 places, 132 transitions, 952 flow. Second operand 10 states and 205 transitions.
[2024-06-20 19:07:25,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 180 transitions, 1612 flow
[2024-06-20 19:07:25,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 180 transitions, 1574 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:07:25,451 INFO  L231             Difference]: Finished difference. Result has 122 places, 136 transitions, 1085 flow
[2024-06-20 19:07:25,451 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1085, PETRI_PLACES=122, PETRI_TRANSITIONS=136}
[2024-06-20 19:07:25,452 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 77 predicate places.
[2024-06-20 19:07:25,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 1085 flow
[2024-06-20 19:07:25,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:07:25,452 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:25,453 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:25,453 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:07:25,453 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:07:25,453 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:25,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -1340226808, now seen corresponding path program 1 times
[2024-06-20 19:07:25,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:25,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954479313]
[2024-06-20 19:07:25,454 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:25,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:25,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:42,247 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:07:42,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:42,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954479313]
[2024-06-20 19:07:42,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954479313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:42,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:42,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:07:42,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833240737]
[2024-06-20 19:07:42,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:42,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:07:42,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:42,248 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:07:42,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:07:42,473 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:07:42,473 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 1085 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:42,473 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:42,473 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:07:42,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:45,074 INFO  L124   PetriNetUnfolderBase]: 2523/3857 cut-off events.
[2024-06-20 19:07:45,074 INFO  L125   PetriNetUnfolderBase]: For 197509/197509 co-relation queries the response was YES.
[2024-06-20 19:07:45,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27604 conditions, 3857 events. 2523/3857 cut-off events. For 197509/197509 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19512 event pairs, 780 based on Foata normal form. 2/3857 useless extension candidates. Maximal degree in co-relation 27551. Up to 3580 conditions per place. 
[2024-06-20 19:07:45,097 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 148 selfloop transitions, 29 changer transitions 0/183 dead transitions.
[2024-06-20 19:07:45,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 183 transitions, 1609 flow
[2024-06-20 19:07:45,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:07:45,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:07:45,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions.
[2024-06-20 19:07:45,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-20 19:07:45,101 INFO  L175             Difference]: Start difference. First operand has 122 places, 136 transitions, 1085 flow. Second operand 11 states and 209 transitions.
[2024-06-20 19:07:45,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 183 transitions, 1609 flow
[2024-06-20 19:07:45,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 183 transitions, 1515 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-20 19:07:45,180 INFO  L231             Difference]: Finished difference. Result has 127 places, 139 transitions, 1123 flow
[2024-06-20 19:07:45,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1123, PETRI_PLACES=127, PETRI_TRANSITIONS=139}
[2024-06-20 19:07:45,181 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 82 predicate places.
[2024-06-20 19:07:45,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 139 transitions, 1123 flow
[2024-06-20 19:07:45,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:45,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:45,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:45,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:07:45,181 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:07:45,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:45,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -1340226932, now seen corresponding path program 2 times
[2024-06-20 19:07:45,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:45,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205489320]
[2024-06-20 19:07:45,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:45,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:45,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:00,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:00,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:00,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205489320]
[2024-06-20 19:08:00,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205489320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:00,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:00,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:08:00,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994743081]
[2024-06-20 19:08:00,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:00,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:08:00,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:00,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:08:00,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:08:01,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:08:01,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 139 transitions, 1123 flow. Second operand  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:08:01,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:01,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:08:01,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:03,622 INFO  L124   PetriNetUnfolderBase]: 2417/3761 cut-off events.
[2024-06-20 19:08:03,622 INFO  L125   PetriNetUnfolderBase]: For 210925/210925 co-relation queries the response was YES.
[2024-06-20 19:08:03,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27570 conditions, 3761 events. 2417/3761 cut-off events. For 210925/210925 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19528 event pairs, 745 based on Foata normal form. 4/3763 useless extension candidates. Maximal degree in co-relation 27515. Up to 3396 conditions per place. 
[2024-06-20 19:08:03,646 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 139 selfloop transitions, 25 changer transitions 0/182 dead transitions.
[2024-06-20 19:08:03,646 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 182 transitions, 1593 flow
[2024-06-20 19:08:03,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:08:03,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:08:03,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-20 19:08:03,647 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4590909090909091
[2024-06-20 19:08:03,647 INFO  L175             Difference]: Start difference. First operand has 127 places, 139 transitions, 1123 flow. Second operand 10 states and 202 transitions.
[2024-06-20 19:08:03,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 182 transitions, 1593 flow
[2024-06-20 19:08:03,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 1489 flow, removed 26 selfloop flow, removed 9 redundant places.
[2024-06-20 19:08:03,734 INFO  L231             Difference]: Finished difference. Result has 128 places, 141 transitions, 1118 flow
[2024-06-20 19:08:03,734 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1118, PETRI_PLACES=128, PETRI_TRANSITIONS=141}
[2024-06-20 19:08:03,735 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 83 predicate places.
[2024-06-20 19:08:03,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 1118 flow
[2024-06-20 19:08:03,735 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:08:03,735 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:03,735 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:03,735 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:08:03,735 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:03,736 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:03,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 1789658108, now seen corresponding path program 3 times
[2024-06-20 19:08:03,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:03,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030941865]
[2024-06-20 19:08:03,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:03,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:03,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:19,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:19,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:19,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030941865]
[2024-06-20 19:08:19,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030941865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:19,719 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:19,719 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:08:19,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308574271]
[2024-06-20 19:08:19,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:19,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:08:19,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:19,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:08:19,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:08:20,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:08:20,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 1118 flow. Second operand  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:08:20,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:20,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:08:20,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:22,231 INFO  L124   PetriNetUnfolderBase]: 2409/3749 cut-off events.
[2024-06-20 19:08:22,231 INFO  L125   PetriNetUnfolderBase]: For 220726/220726 co-relation queries the response was YES.
[2024-06-20 19:08:22,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27676 conditions, 3749 events. 2409/3749 cut-off events. For 220726/220726 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19461 event pairs, 743 based on Foata normal form. 4/3751 useless extension candidates. Maximal degree in co-relation 27620. Up to 3408 conditions per place. 
[2024-06-20 19:08:22,255 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 138 selfloop transitions, 19 changer transitions 0/175 dead transitions.
[2024-06-20 19:08:22,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 175 transitions, 1518 flow
[2024-06-20 19:08:22,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:08:22,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:08:22,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-20 19:08:22,259 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-20 19:08:22,259 INFO  L175             Difference]: Start difference. First operand has 128 places, 141 transitions, 1118 flow. Second operand 9 states and 180 transitions.
[2024-06-20 19:08:22,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 175 transitions, 1518 flow
[2024-06-20 19:08:22,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 1413 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-20 19:08:22,358 INFO  L231             Difference]: Finished difference. Result has 129 places, 141 transitions, 1058 flow
[2024-06-20 19:08:22,359 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1058, PETRI_PLACES=129, PETRI_TRANSITIONS=141}
[2024-06-20 19:08:22,359 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places.
[2024-06-20 19:08:22,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 141 transitions, 1058 flow
[2024-06-20 19:08:22,359 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:08:22,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:22,359 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:22,359 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:08:22,359 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:22,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:22,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1337425462, now seen corresponding path program 1 times
[2024-06-20 19:08:22,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:22,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758788737]
[2024-06-20 19:08:22,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:22,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:22,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:37,136 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:08:37,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:37,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758788737]
[2024-06-20 19:08:37,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758788737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:37,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:37,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:08:37,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424259283]
[2024-06-20 19:08:37,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:37,137 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:08:37,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:37,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:08:37,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:08:37,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:37,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 141 transitions, 1058 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:37,405 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:37,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:37,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:39,678 INFO  L124   PetriNetUnfolderBase]: 2557/3903 cut-off events.
[2024-06-20 19:08:39,678 INFO  L125   PetriNetUnfolderBase]: For 233897/233897 co-relation queries the response was YES.
[2024-06-20 19:08:39,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28856 conditions, 3903 events. 2557/3903 cut-off events. For 233897/233897 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19747 event pairs, 772 based on Foata normal form. 4/3903 useless extension candidates. Maximal degree in co-relation 28799. Up to 3666 conditions per place. 
[2024-06-20 19:08:39,701 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 152 selfloop transitions, 20 changer transitions 0/178 dead transitions.
[2024-06-20 19:08:39,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 178 transitions, 1548 flow
[2024-06-20 19:08:39,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:08:39,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:08:39,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 19:08:39,705 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43686868686868685
[2024-06-20 19:08:39,705 INFO  L175             Difference]: Start difference. First operand has 129 places, 141 transitions, 1058 flow. Second operand 9 states and 173 transitions.
[2024-06-20 19:08:39,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 178 transitions, 1548 flow
[2024-06-20 19:08:39,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 178 transitions, 1498 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-20 19:08:39,786 INFO  L231             Difference]: Finished difference. Result has 130 places, 144 transitions, 1120 flow
[2024-06-20 19:08:39,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=130, PETRI_TRANSITIONS=144}
[2024-06-20 19:08:39,787 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places.
[2024-06-20 19:08:39,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 144 transitions, 1120 flow
[2024-06-20 19:08:39,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:39,787 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:39,787 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:39,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:08:39,787 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:39,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:39,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -1221954802, now seen corresponding path program 2 times
[2024-06-20 19:08:39,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:39,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081974098]
[2024-06-20 19:08:39,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:39,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:39,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:54,655 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:08:54,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:54,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081974098]
[2024-06-20 19:08:54,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081974098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:54,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:54,656 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:08:54,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747842603]
[2024-06-20 19:08:54,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:54,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:08:54,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:54,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:08:54,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:08:54,937 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:08:54,938 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 144 transitions, 1120 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:54,938 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:54,938 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:08:54,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:57,070 INFO  L124   PetriNetUnfolderBase]: 2627/4014 cut-off events.
[2024-06-20 19:08:57,070 INFO  L125   PetriNetUnfolderBase]: For 252856/252856 co-relation queries the response was YES.
[2024-06-20 19:08:57,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30518 conditions, 4014 events. 2627/4014 cut-off events. For 252856/252856 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20405 event pairs, 737 based on Foata normal form. 4/4014 useless extension candidates. Maximal degree in co-relation 30460. Up to 3444 conditions per place. 
[2024-06-20 19:08:57,097 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 120 selfloop transitions, 68 changer transitions 0/194 dead transitions.
[2024-06-20 19:08:57,097 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 194 transitions, 2074 flow
[2024-06-20 19:08:57,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:08:57,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:08:57,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-20 19:08:57,100 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4590909090909091
[2024-06-20 19:08:57,101 INFO  L175             Difference]: Start difference. First operand has 130 places, 144 transitions, 1120 flow. Second operand 10 states and 202 transitions.
[2024-06-20 19:08:57,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 194 transitions, 2074 flow
[2024-06-20 19:08:57,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 194 transitions, 1986 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-20 19:08:57,198 INFO  L231             Difference]: Finished difference. Result has 133 places, 153 transitions, 1374 flow
[2024-06-20 19:08:57,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1374, PETRI_PLACES=133, PETRI_TRANSITIONS=153}
[2024-06-20 19:08:57,199 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 88 predicate places.
[2024-06-20 19:08:57,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 153 transitions, 1374 flow
[2024-06-20 19:08:57,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:57,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:57,199 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:57,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:08:57,199 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:57,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:57,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905127032, now seen corresponding path program 2 times
[2024-06-20 19:08:57,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:57,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779784556]
[2024-06-20 19:08:57,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:57,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:57,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:12,744 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:09:12,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:12,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779784556]
[2024-06-20 19:09:12,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779784556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:12,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:12,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:09:12,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879369620]
[2024-06-20 19:09:12,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:12,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:09:12,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:12,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:09:12,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:09:13,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:13,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 153 transitions, 1374 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:13,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:13,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:13,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:15,396 INFO  L124   PetriNetUnfolderBase]: 2638/4030 cut-off events.
[2024-06-20 19:09:15,396 INFO  L125   PetriNetUnfolderBase]: For 267545/267545 co-relation queries the response was YES.
[2024-06-20 19:09:15,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31471 conditions, 4030 events. 2638/4030 cut-off events. For 267545/267545 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20505 event pairs, 778 based on Foata normal form. 2/4028 useless extension candidates. Maximal degree in co-relation 31412. Up to 3666 conditions per place. 
[2024-06-20 19:09:15,424 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 130 selfloop transitions, 54 changer transitions 0/190 dead transitions.
[2024-06-20 19:09:15,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 190 transitions, 1896 flow
[2024-06-20 19:09:15,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:09:15,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:09:15,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-20 19:09:15,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43636363636363634
[2024-06-20 19:09:15,426 INFO  L175             Difference]: Start difference. First operand has 133 places, 153 transitions, 1374 flow. Second operand 10 states and 192 transitions.
[2024-06-20 19:09:15,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 190 transitions, 1896 flow
[2024-06-20 19:09:15,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 190 transitions, 1784 flow, removed 37 selfloop flow, removed 5 redundant places.
[2024-06-20 19:09:15,523 INFO  L231             Difference]: Finished difference. Result has 138 places, 156 transitions, 1452 flow
[2024-06-20 19:09:15,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1452, PETRI_PLACES=138, PETRI_TRANSITIONS=156}
[2024-06-20 19:09:15,524 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 93 predicate places.
[2024-06-20 19:09:15,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 156 transitions, 1452 flow
[2024-06-20 19:09:15,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:15,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:15,524 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:15,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:09:15,524 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:15,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:15,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -1222134292, now seen corresponding path program 3 times
[2024-06-20 19:09:15,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:15,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879053682]
[2024-06-20 19:09:15,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:15,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:15,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:31,544 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:09:31,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:31,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879053682]
[2024-06-20 19:09:31,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879053682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:31,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:31,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:09:31,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413156752]
[2024-06-20 19:09:31,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:31,545 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:09:31,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:31,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:09:31,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:09:31,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:31,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 156 transitions, 1452 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:31,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:31,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:31,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:34,101 INFO  L124   PetriNetUnfolderBase]: 2660/4067 cut-off events.
[2024-06-20 19:09:34,101 INFO  L125   PetriNetUnfolderBase]: For 283072/283072 co-relation queries the response was YES.
[2024-06-20 19:09:34,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32365 conditions, 4067 events. 2660/4067 cut-off events. For 283072/283072 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20705 event pairs, 737 based on Foata normal form. 4/4067 useless extension candidates. Maximal degree in co-relation 32304. Up to 3479 conditions per place. 
[2024-06-20 19:09:34,131 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 127 selfloop transitions, 68 changer transitions 0/201 dead transitions.
[2024-06-20 19:09:34,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 201 transitions, 2302 flow
[2024-06-20 19:09:34,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:09:34,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:09:34,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-20 19:09:34,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-20 19:09:34,135 INFO  L175             Difference]: Start difference. First operand has 138 places, 156 transitions, 1452 flow. Second operand 10 states and 205 transitions.
[2024-06-20 19:09:34,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 201 transitions, 2302 flow
[2024-06-20 19:09:34,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 2136 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-06-20 19:09:34,264 INFO  L231             Difference]: Finished difference. Result has 140 places, 159 transitions, 1484 flow
[2024-06-20 19:09:34,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1484, PETRI_PLACES=140, PETRI_TRANSITIONS=159}
[2024-06-20 19:09:34,265 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places.
[2024-06-20 19:09:34,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 159 transitions, 1484 flow
[2024-06-20 19:09:34,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:34,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:34,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:34,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:09:34,265 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:34,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:34,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905127218, now seen corresponding path program 4 times
[2024-06-20 19:09:34,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:34,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729557097]
[2024-06-20 19:09:34,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:34,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:34,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:49,567 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:09:49,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:49,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729557097]
[2024-06-20 19:09:49,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729557097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:49,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:49,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:09:49,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704290547]
[2024-06-20 19:09:49,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:49,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:09:49,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:49,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:09:49,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:09:49,865 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:09:49,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 159 transitions, 1484 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:49,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:49,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:09:49,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:52,151 INFO  L124   PetriNetUnfolderBase]: 2650/4053 cut-off events.
[2024-06-20 19:09:52,152 INFO  L125   PetriNetUnfolderBase]: For 293647/293647 co-relation queries the response was YES.
[2024-06-20 19:09:52,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32507 conditions, 4053 events. 2650/4053 cut-off events. For 293647/293647 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20615 event pairs, 735 based on Foata normal form. 4/4053 useless extension candidates. Maximal degree in co-relation 32445. Up to 3471 conditions per place. 
[2024-06-20 19:09:52,179 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 124 selfloop transitions, 69 changer transitions 0/199 dead transitions.
[2024-06-20 19:09:52,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 199 transitions, 2128 flow
[2024-06-20 19:09:52,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:09:52,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:09:52,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-20 19:09:52,182 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4590909090909091
[2024-06-20 19:09:52,182 INFO  L175             Difference]: Start difference. First operand has 140 places, 159 transitions, 1484 flow. Second operand 10 states and 202 transitions.
[2024-06-20 19:09:52,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 199 transitions, 2128 flow
[2024-06-20 19:09:52,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 199 transitions, 1926 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-20 19:09:52,298 INFO  L231             Difference]: Finished difference. Result has 143 places, 159 transitions, 1428 flow
[2024-06-20 19:09:52,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1428, PETRI_PLACES=143, PETRI_TRANSITIONS=159}
[2024-06-20 19:09:52,299 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-20 19:09:52,299 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 159 transitions, 1428 flow
[2024-06-20 19:09:52,299 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:52,299 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:52,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:52,300 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:09:52,300 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:52,300 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:52,300 INFO  L85        PathProgramCache]: Analyzing trace with hash 1904949278, now seen corresponding path program 4 times
[2024-06-20 19:09:52,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:52,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245434363]
[2024-06-20 19:09:52,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:52,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:52,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:08,162 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:10:08,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:08,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245434363]
[2024-06-20 19:10:08,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245434363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:08,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:08,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:10:08,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999812581]
[2024-06-20 19:10:08,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:08,162 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:10:08,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:08,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:10:08,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:10:08,546 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:10:08,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 159 transitions, 1428 flow. Second operand  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:10:08,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:08,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:10:08,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:10,829 INFO  L124   PetriNetUnfolderBase]: 2532/3945 cut-off events.
[2024-06-20 19:10:10,829 INFO  L125   PetriNetUnfolderBase]: For 306026/306026 co-relation queries the response was YES.
[2024-06-20 19:10:10,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31996 conditions, 3945 events. 2532/3945 cut-off events. For 306026/306026 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20694 event pairs, 741 based on Foata normal form. 4/3945 useless extension candidates. Maximal degree in co-relation 31933. Up to 3545 conditions per place. 
[2024-06-20 19:10:10,856 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 145 selfloop transitions, 32 changer transitions 0/196 dead transitions.
[2024-06-20 19:10:10,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 196 transitions, 1934 flow
[2024-06-20 19:10:10,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:10:10,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:10:10,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 19:10:10,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:10:10,859 INFO  L175             Difference]: Start difference. First operand has 143 places, 159 transitions, 1428 flow. Second operand 10 states and 198 transitions.
[2024-06-20 19:10:10,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 196 transitions, 1934 flow
[2024-06-20 19:10:11,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 196 transitions, 1770 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-06-20 19:10:11,007 INFO  L231             Difference]: Finished difference. Result has 143 places, 161 transitions, 1403 flow
[2024-06-20 19:10:11,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1403, PETRI_PLACES=143, PETRI_TRANSITIONS=161}
[2024-06-20 19:10:11,007 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-20 19:10:11,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 161 transitions, 1403 flow
[2024-06-20 19:10:11,008 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:10:11,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:11,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:11,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:10:11,008 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:11,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:11,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 1904949402, now seen corresponding path program 3 times
[2024-06-20 19:10:11,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:11,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660496075]
[2024-06-20 19:10:11,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:11,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:11,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:27,454 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:10:27,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:27,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660496075]
[2024-06-20 19:10:27,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660496075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:27,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:27,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:10:27,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490252919]
[2024-06-20 19:10:27,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:27,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:10:27,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:27,455 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:10:27,455 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:10:27,761 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:10:27,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 161 transitions, 1403 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:27,762 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:27,762 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:10:27,762 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:30,163 INFO  L124   PetriNetUnfolderBase]: 2694/4119 cut-off events.
[2024-06-20 19:10:30,163 INFO  L125   PetriNetUnfolderBase]: For 323445/323445 co-relation queries the response was YES.
[2024-06-20 19:10:30,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33671 conditions, 4119 events. 2694/4119 cut-off events. For 323445/323445 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21024 event pairs, 776 based on Foata normal form. 2/4117 useless extension candidates. Maximal degree in co-relation 33607. Up to 3721 conditions per place. 
[2024-06-20 19:10:30,190 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 136 selfloop transitions, 61 changer transitions 0/203 dead transitions.
[2024-06-20 19:10:30,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 203 transitions, 2199 flow
[2024-06-20 19:10:30,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:10:30,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:10:30,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-20 19:10:30,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44545454545454544
[2024-06-20 19:10:30,193 INFO  L175             Difference]: Start difference. First operand has 143 places, 161 transitions, 1403 flow. Second operand 10 states and 196 transitions.
[2024-06-20 19:10:30,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 203 transitions, 2199 flow
[2024-06-20 19:10:30,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 203 transitions, 2078 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-06-20 19:10:30,314 INFO  L231             Difference]: Finished difference. Result has 145 places, 167 transitions, 1570 flow
[2024-06-20 19:10:30,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1570, PETRI_PLACES=145, PETRI_TRANSITIONS=167}
[2024-06-20 19:10:30,314 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 100 predicate places.
[2024-06-20 19:10:30,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 167 transitions, 1570 flow
[2024-06-20 19:10:30,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:30,315 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:30,315 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:30,315 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:10:30,315 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:30,315 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:30,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1222134478, now seen corresponding path program 4 times
[2024-06-20 19:10:30,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:30,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92891540]
[2024-06-20 19:10:30,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:30,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:30,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:45,684 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:10:45,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:45,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92891540]
[2024-06-20 19:10:45,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92891540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:45,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:45,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:10:45,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063906372]
[2024-06-20 19:10:45,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:45,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:10:45,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:45,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:10:45,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:10:45,856 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:10:45,857 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 167 transitions, 1570 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:45,857 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:45,857 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:10:45,857 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:48,218 INFO  L124   PetriNetUnfolderBase]: 2689/4112 cut-off events.
[2024-06-20 19:10:48,218 INFO  L125   PetriNetUnfolderBase]: For 337709/337709 co-relation queries the response was YES.
[2024-06-20 19:10:48,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34193 conditions, 4112 events. 2689/4112 cut-off events. For 337709/337709 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21006 event pairs, 776 based on Foata normal form. 2/4110 useless extension candidates. Maximal degree in co-relation 34128. Up to 3743 conditions per place. 
[2024-06-20 19:10:48,248 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 142 selfloop transitions, 53 changer transitions 0/201 dead transitions.
[2024-06-20 19:10:48,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 201 transitions, 2046 flow
[2024-06-20 19:10:48,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:10:48,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:10:48,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-20 19:10:48,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43863636363636366
[2024-06-20 19:10:48,251 INFO  L175             Difference]: Start difference. First operand has 145 places, 167 transitions, 1570 flow. Second operand 10 states and 193 transitions.
[2024-06-20 19:10:48,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 201 transitions, 2046 flow
[2024-06-20 19:10:48,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 201 transitions, 1858 flow, removed 65 selfloop flow, removed 6 redundant places.
[2024-06-20 19:10:48,392 INFO  L231             Difference]: Finished difference. Result has 149 places, 167 transitions, 1496 flow
[2024-06-20 19:10:48,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1496, PETRI_PLACES=149, PETRI_TRANSITIONS=167}
[2024-06-20 19:10:48,393 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places.
[2024-06-20 19:10:48,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 167 transitions, 1496 flow
[2024-06-20 19:10:48,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:48,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:48,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:48,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:10:48,393 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:48,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:48,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 56463400, now seen corresponding path program 1 times
[2024-06-20 19:10:48,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:48,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255886008]
[2024-06-20 19:10:48,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:48,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:48,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:07,019 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:11:07,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:07,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255886008]
[2024-06-20 19:11:07,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255886008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:07,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:07,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:11:07,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136242666]
[2024-06-20 19:11:07,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:07,020 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:11:07,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:07,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:11:07,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:11:07,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-20 19:11:07,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 167 transitions, 1496 flow. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:07,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:07,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-20 19:11:07,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:09,431 INFO  L124   PetriNetUnfolderBase]: 2793/4351 cut-off events.
[2024-06-20 19:11:09,431 INFO  L125   PetriNetUnfolderBase]: For 393633/393639 co-relation queries the response was YES.
[2024-06-20 19:11:09,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36936 conditions, 4351 events. 2793/4351 cut-off events. For 393633/393639 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 22784 event pairs, 926 based on Foata normal form. 4/4341 useless extension candidates. Maximal degree in co-relation 36869. Up to 3963 conditions per place. 
[2024-06-20 19:11:09,467 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 140 selfloop transitions, 18 changer transitions 0/189 dead transitions.
[2024-06-20 19:11:09,467 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 189 transitions, 2006 flow
[2024-06-20 19:11:09,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:11:09,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:11:09,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-20 19:11:09,468 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4621212121212121
[2024-06-20 19:11:09,468 INFO  L175             Difference]: Start difference. First operand has 149 places, 167 transitions, 1496 flow. Second operand 6 states and 122 transitions.
[2024-06-20 19:11:09,468 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 189 transitions, 2006 flow
[2024-06-20 19:11:09,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 189 transitions, 1882 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-20 19:11:09,601 INFO  L231             Difference]: Finished difference. Result has 146 places, 173 transitions, 1489 flow
[2024-06-20 19:11:09,601 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1489, PETRI_PLACES=146, PETRI_TRANSITIONS=173}
[2024-06-20 19:11:09,601 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 101 predicate places.
[2024-06-20 19:11:09,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 173 transitions, 1489 flow
[2024-06-20 19:11:09,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:09,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:09,602 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:09,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:11:09,602 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:09,602 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:09,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 329826098, now seen corresponding path program 5 times
[2024-06-20 19:11:09,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:09,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513798392]
[2024-06-20 19:11:09,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:09,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:09,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:25,118 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:11:25,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:25,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513798392]
[2024-06-20 19:11:25,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513798392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:25,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:25,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:11:25,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62697097]
[2024-06-20 19:11:25,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:25,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:11:25,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:25,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:11:25,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:11:25,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:11:25,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 173 transitions, 1489 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:25,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:25,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:11:25,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:27,781 INFO  L124   PetriNetUnfolderBase]: 2814/4289 cut-off events.
[2024-06-20 19:11:27,781 INFO  L125   PetriNetUnfolderBase]: For 378304/378304 co-relation queries the response was YES.
[2024-06-20 19:11:27,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36675 conditions, 4289 events. 2814/4289 cut-off events. For 378304/378304 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21934 event pairs, 780 based on Foata normal form. 4/4289 useless extension candidates. Maximal degree in co-relation 36607. Up to 3834 conditions per place. 
[2024-06-20 19:11:27,814 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 167 selfloop transitions, 46 changer transitions 0/219 dead transitions.
[2024-06-20 19:11:27,814 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 2731 flow
[2024-06-20 19:11:27,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:27,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:27,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-20 19:11:27,817 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46464646464646464
[2024-06-20 19:11:27,817 INFO  L175             Difference]: Start difference. First operand has 146 places, 173 transitions, 1489 flow. Second operand 9 states and 184 transitions.
[2024-06-20 19:11:27,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 2731 flow
[2024-06-20 19:11:27,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 219 transitions, 2695 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-20 19:11:27,968 INFO  L231             Difference]: Finished difference. Result has 153 places, 182 transitions, 1763 flow
[2024-06-20 19:11:27,968 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1763, PETRI_PLACES=153, PETRI_TRANSITIONS=182}
[2024-06-20 19:11:27,969 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 108 predicate places.
[2024-06-20 19:11:27,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 182 transitions, 1763 flow
[2024-06-20 19:11:27,969 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:27,969 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:27,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:27,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:11:27,970 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:27,970 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:27,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 329825912, now seen corresponding path program 5 times
[2024-06-20 19:11:27,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:27,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82383818]
[2024-06-20 19:11:27,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:27,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:28,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:45,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:45,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:45,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82383818]
[2024-06-20 19:11:45,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82383818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:45,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:45,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:11:45,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003641284]
[2024-06-20 19:11:45,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:45,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:11:45,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:45,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:11:45,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:11:45,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-20 19:11:45,537 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 182 transitions, 1763 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:45,537 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:45,537 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-20 19:11:45,537 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:48,037 INFO  L124   PetriNetUnfolderBase]: 2825/4305 cut-off events.
[2024-06-20 19:11:48,038 INFO  L125   PetriNetUnfolderBase]: For 393513/393513 co-relation queries the response was YES.
[2024-06-20 19:11:48,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37392 conditions, 4305 events. 2825/4305 cut-off events. For 393513/393513 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 22019 event pairs, 787 based on Foata normal form. 2/4303 useless extension candidates. Maximal degree in co-relation 37322. Up to 4019 conditions per place. 
[2024-06-20 19:11:48,071 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 174 selfloop transitions, 32 changer transitions 0/212 dead transitions.
[2024-06-20 19:11:48,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 2325 flow
[2024-06-20 19:11:48,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:48,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:48,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-20 19:11:48,075 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4292929292929293
[2024-06-20 19:11:48,075 INFO  L175             Difference]: Start difference. First operand has 153 places, 182 transitions, 1763 flow. Second operand 9 states and 170 transitions.
[2024-06-20 19:11:48,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 2325 flow
[2024-06-20 19:11:48,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 212 transitions, 2149 flow, removed 44 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:48,250 INFO  L231             Difference]: Finished difference. Result has 157 places, 185 transitions, 1747 flow
[2024-06-20 19:11:48,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1747, PETRI_PLACES=157, PETRI_TRANSITIONS=185}
[2024-06-20 19:11:48,251 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 112 predicate places.
[2024-06-20 19:11:48,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 185 transitions, 1747 flow
[2024-06-20 19:11:48,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:48,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:48,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:48,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:11:48,252 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:48,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:48,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 2070772862, now seen corresponding path program 6 times
[2024-06-20 19:11:48,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:48,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77913283]
[2024-06-20 19:11:48,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:48,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:48,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15