./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix032.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version b44c8288
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix032.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m
[2024-05-12 11:39:14,420 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-12 11:39:14,510 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-05-12 11:39:14,515 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-12 11:39:14,516 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-12 11:39:14,548 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-12 11:39:14,549 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-12 11:39:14,550 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-12 11:39:14,550 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-05-12 11:39:14,554 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-05-12 11:39:14,554 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-12 11:39:14,555 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-12 11:39:14,556 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-12 11:39:14,557 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-12 11:39:14,558 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-12 11:39:14,558 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-12 11:39:14,558 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-12 11:39:14,559 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-12 11:39:14,559 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-12 11:39:14,559 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-12 11:39:14,559 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-12 11:39:14,560 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-12 11:39:14,560 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-12 11:39:14,561 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-12 11:39:14,561 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-05-12 11:39:14,561 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-12 11:39:14,561 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-12 11:39:14,562 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-12 11:39:14,563 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-12 11:39:14,563 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-12 11:39:14,564 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-05-12 11:39:14,564 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-12 11:39:14,564 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:39:14,565 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-12 11:39:14,565 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-12 11:39:14,565 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-12 11:39:14,566 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-12 11:39:14,566 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-12 11:39:14,566 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-12 11:39:14,566 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-05-12 11:39:14,567 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-12 11:39:14,567 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-05-12 11:39:14,567 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-05-12 11:39:14,567 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
[2024-05-12 11:39:14,839 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-12 11:39:14,863 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-12 11:39:14,865 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-12 11:39:14,866 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-05-12 11:39:14,867 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-05-12 11:39:14,868 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix032.opt.yml/witness.yml
[2024-05-12 11:39:15,086 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-12 11:39:15,087 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-12 11:39:15,088 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i
[2024-05-12 11:39:16,271 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-12 11:39:16,523 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-12 11:39:16,523 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i
[2024-05-12 11:39:16,537 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e57b7136/97eccba27844411fabb815740369802c/FLAG31c22161d
[2024-05-12 11:39:16,550 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e57b7136/97eccba27844411fabb815740369802c
[2024-05-12 11:39:16,551 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-12 11:39:16,554 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-12 11:39:16,556 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-12 11:39:16,557 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-12 11:39:16,561 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-12 11:39:16,562 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:15" (1/2) ...
[2024-05-12 11:39:16,563 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c3041f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:39:16, skipping insertion in model container
[2024-05-12 11:39:16,564 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:15" (1/2) ...
[2024-05-12 11:39:16,565 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f95285a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:39:16, skipping insertion in model container
[2024-05-12 11:39:16,565 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:39:16" (2/2) ...
[2024-05-12 11:39:16,565 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c3041f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:16, skipping insertion in model container
[2024-05-12 11:39:16,566 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:39:16" (2/2) ...
[2024-05-12 11:39:16,566 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-05-12 11:39:16,672 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-05-12 11:39:16,673 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((((! 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 <= __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 )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! 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 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-05-12 11:39:16,674 INFO  L97    edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((((((((! 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 <= __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 )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! 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 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-05-12 11:39:16,675 INFO  L97    edCorrectnessWitness]: Location invariant before [L848-L848] (((((((((((((((((((((((! 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 <= __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 )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )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 )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! 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 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-05-12 11:39:16,676 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-05-12 11:39:16,676 INFO  L106   edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1;
[2024-05-12 11:39:16,722 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-12 11:39:16,932 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i[944,957]
[2024-05-12 11:39:17,084 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:39:17,093 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-05-12 11:39:17,127 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i[944,957]
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-05-12 11:39:17,544 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:39:17,591 INFO  L206         MainTranslator]: Completed translation
[2024-05-12 11:39:17,592 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17 WrapperNode
[2024-05-12 11:39:17,592 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-12 11:39:17,593 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-12 11:39:17,593 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-12 11:39:17,593 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-12 11:39:17,600 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:17,662 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:17,906 INFO  L138                Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144
[2024-05-12 11:39:17,907 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-12 11:39:17,908 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-12 11:39:17,908 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-12 11:39:17,908 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-12 11:39:17,918 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:17,919 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:17,965 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,015 INFO  L175           MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1].
[2024-05-12 11:39:18,017 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,017 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,147 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,158 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,170 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,180 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,204 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-12 11:39:18,205 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-12 11:39:18,206 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-12 11:39:18,206 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-12 11:39:18,207 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (1/1) ...
[2024-05-12 11:39:18,213 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:39:18,221 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-05-12 11:39:18,237 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-05-12 11:39:18,270 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-05-12 11:39:18,284 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-05-12 11:39:18,284 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-05-12 11:39:18,284 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-05-12 11:39:18,284 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-05-12 11:39:18,285 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-12 11:39:18,285 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-12 11:39:18,285 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-12 11:39:18,286 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-12 11:39:18,286 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-05-12 11:39:18,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-05-12 11:39:18,286 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-05-12 11:39:18,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-05-12 11:39:18,287 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-05-12 11:39:18,287 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-05-12 11:39:18,288 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-05-12 11:39:18,288 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-05-12 11:39:18,288 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-05-12 11:39:18,289 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-05-12 11:39:18,289 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-12 11:39:18,289 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-12 11:39:18,289 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-12 11:39:18,291 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-12 11:39:18,460 INFO  L244             CfgBuilder]: Building ICFG
[2024-05-12 11:39:18,462 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-12 11:39:20,393 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-05-12 11:39:20,393 INFO  L293             CfgBuilder]: Performing block encoding
[2024-05-12 11:39:20,786 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-12 11:39:20,786 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-12 11:39:20,788 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:39:20 BoogieIcfgContainer
[2024-05-12 11:39:20,788 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-12 11:39:20,791 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-12 11:39:20,791 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-12 11:39:20,794 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-12 11:39:20,794 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:15" (1/4) ...
[2024-05-12 11:39:20,794 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eceb78d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:39:20, skipping insertion in model container
[2024-05-12 11:39:20,795 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:39:16" (2/4) ...
[2024-05-12 11:39:20,795 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eceb78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:39:20, skipping insertion in model container
[2024-05-12 11:39:20,795 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:17" (3/4) ...
[2024-05-12 11:39:20,796 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eceb78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:39:20, skipping insertion in model container
[2024-05-12 11:39:20,796 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:39:20" (4/4) ...
[2024-05-12 11:39:20,797 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix032.opt.i
[2024-05-12 11:39:20,812 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-12 11:39:20,812 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-05-12 11:39:20,813 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-12 11:39:20,949 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-12 11:39:20,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 114 flow
[2024-05-12 11:39:21,096 INFO  L124   PetriNetUnfolderBase]: 1/48 cut-off events.
[2024-05-12 11:39:21,096 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:39:21,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58 conditions, 48 events. 1/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. 
[2024-05-12 11:39:21,101 INFO  L82        GeneralOperation]: Start removeDead. Operand has 60 places, 51 transitions, 114 flow
[2024-05-12 11:39:21,104 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 105 flow
[2024-05-12 11:39:21,117 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-12 11:39:21,125 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;@4417ffe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-12 11:39:21,125 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-05-12 11:39:21,136 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-05-12 11:39:21,136 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-05-12 11:39:21,137 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:39:21,137 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:21,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:21,138 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:21,142 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:21,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 1846196049, now seen corresponding path program 1 times
[2024-05-12 11:39:21,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:21,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070409940]
[2024-05-12 11:39:21,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:21,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:21,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:31,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:31,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:31,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070409940]
[2024-05-12 11:39:31,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070409940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:31,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:31,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:39:31,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098798049]
[2024-05-12 11:39:31,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:31,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:39:31,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:31,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:39:31,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:39:31,699 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51
[2024-05-12 11:39:31,701 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 105 flow. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:31,702 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:31,702 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51
[2024-05-12 11:39:31,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:33,518 INFO  L124   PetriNetUnfolderBase]: 2860/4475 cut-off events.
[2024-05-12 11:39:33,518 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-05-12 11:39:33,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8686 conditions, 4475 events. 2860/4475 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27563 event pairs, 1598 based on Foata normal form. 169/4370 useless extension candidates. Maximal degree in co-relation 8671. Up to 4134 conditions per place. 
[2024-05-12 11:39:33,556 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 42 selfloop transitions, 5 changer transitions 0/62 dead transitions.
[2024-05-12 11:39:33,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 233 flow
[2024-05-12 11:39:33,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:39:33,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:39:33,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions.
[2024-05-12 11:39:33,569 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6928104575163399
[2024-05-12 11:39:33,571 INFO  L175             Difference]: Start difference. First operand has 57 places, 48 transitions, 105 flow. Second operand 3 states and 106 transitions.
[2024-05-12 11:39:33,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 233 flow
[2024-05-12 11:39:33,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-05-12 11:39:33,581 INFO  L231             Difference]: Finished difference. Result has 57 places, 51 transitions, 137 flow
[2024-05-12 11:39:33,583 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=57, PETRI_TRANSITIONS=51}
[2024-05-12 11:39:33,587 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places.
[2024-05-12 11:39:33,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 137 flow
[2024-05-12 11:39:33,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:33,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:33,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:33,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-12 11:39:33,589 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:33,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:33,590 INFO  L85        PathProgramCache]: Analyzing trace with hash 372948080, now seen corresponding path program 1 times
[2024-05-12 11:39:33,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:33,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454387018]
[2024-05-12 11:39:33,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:33,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:33,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:41,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:41,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:41,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454387018]
[2024-05-12 11:39:41,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454387018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:41,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:41,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-12 11:39:41,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027133607]
[2024-05-12 11:39:41,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:41,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-05-12 11:39:41,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:41,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-05-12 11:39:41,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-05-12 11:39:42,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51
[2024-05-12 11:39:42,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 137 flow. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-05-12 11:39:42,150 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:42,150 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51
[2024-05-12 11:39:42,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:43,931 INFO  L124   PetriNetUnfolderBase]: 3263/4945 cut-off events.
[2024-05-12 11:39:43,933 INFO  L125   PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES.
[2024-05-12 11:39:43,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 4945 events. 3263/4945 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29833 event pairs, 1434 based on Foata normal form. 3/4753 useless extension candidates. Maximal degree in co-relation 10885. Up to 4679 conditions per place. 
[2024-05-12 11:39:43,969 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 54 selfloop transitions, 9 changer transitions 0/77 dead transitions.
[2024-05-12 11:39:43,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 329 flow
[2024-05-12 11:39:43,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-05-12 11:39:43,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-05-12 11:39:43,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions.
[2024-05-12 11:39:43,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6568627450980392
[2024-05-12 11:39:43,978 INFO  L175             Difference]: Start difference. First operand has 57 places, 51 transitions, 137 flow. Second operand 4 states and 134 transitions.
[2024-05-12 11:39:43,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 329 flow
[2024-05-12 11:39:43,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-05-12 11:39:43,982 INFO  L231             Difference]: Finished difference. Result has 60 places, 55 transitions, 183 flow
[2024-05-12 11:39:43,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=60, PETRI_TRANSITIONS=55}
[2024-05-12 11:39:43,989 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2024-05-12 11:39:43,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 183 flow
[2024-05-12 11:39:43,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-05-12 11:39:43,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:43,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:43,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-12 11:39:43,990 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:43,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:43,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -582895241, now seen corresponding path program 1 times
[2024-05-12 11:39:43,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:43,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547659123]
[2024-05-12 11:39:43,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:43,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:44,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:51,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:51,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:51,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547659123]
[2024-05-12 11:39:51,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547659123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:51,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:51,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:39:51,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398151451]
[2024-05-12 11:39:51,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:51,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:39:51,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:51,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:39:51,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:39:51,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51
[2024-05-12 11:39:51,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 183 flow. Second operand  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:51,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:51,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51
[2024-05-12 11:39:51,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:53,920 INFO  L124   PetriNetUnfolderBase]: 4155/6347 cut-off events.
[2024-05-12 11:39:53,920 INFO  L125   PetriNetUnfolderBase]: For 2326/2326 co-relation queries the response was YES.
[2024-05-12 11:39:53,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15097 conditions, 6347 events. 4155/6347 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 38794 event pairs, 1396 based on Foata normal form. 6/6066 useless extension candidates. Maximal degree in co-relation 15080. Up to 5857 conditions per place. 
[2024-05-12 11:39:53,959 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 74 selfloop transitions, 16 changer transitions 0/103 dead transitions.
[2024-05-12 11:39:53,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 496 flow
[2024-05-12 11:39:53,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:39:53,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:39:53,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions.
[2024-05-12 11:39:53,961 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6176470588235294
[2024-05-12 11:39:53,961 INFO  L175             Difference]: Start difference. First operand has 60 places, 55 transitions, 183 flow. Second operand 6 states and 189 transitions.
[2024-05-12 11:39:53,962 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 496 flow
[2024-05-12 11:39:53,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 468 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-05-12 11:39:53,965 INFO  L231             Difference]: Finished difference. Result has 64 places, 61 transitions, 243 flow
[2024-05-12 11:39:53,965 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=64, PETRI_TRANSITIONS=61}
[2024-05-12 11:39:53,966 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places.
[2024-05-12 11:39:53,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 243 flow
[2024-05-12 11:39:53,966 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:53,967 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:53,967 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:53,967 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-12 11:39:53,967 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:53,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:53,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -1330855858, now seen corresponding path program 1 times
[2024-05-12 11:39:53,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:53,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112148145]
[2024-05-12 11:39:53,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:53,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:54,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:10,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:10,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:10,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112148145]
[2024-05-12 11:40:10,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112148145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:10,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:10,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:40:10,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196131564]
[2024-05-12 11:40:10,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:10,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:40:10,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:10,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:40:10,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:40:10,645 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51
[2024-05-12 11:40:10,646 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 243 flow. Second operand  has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:10,646 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:10,646 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51
[2024-05-12 11:40:10,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:13,231 INFO  L124   PetriNetUnfolderBase]: 4149/6426 cut-off events.
[2024-05-12 11:40:13,232 INFO  L125   PetriNetUnfolderBase]: For 4214/4214 co-relation queries the response was YES.
[2024-05-12 11:40:13,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 6426 events. 4149/6426 cut-off events. For 4214/4214 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 39222 event pairs, 1466 based on Foata normal form. 2/6121 useless extension candidates. Maximal degree in co-relation 16534. Up to 5921 conditions per place. 
[2024-05-12 11:40:13,261 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions.
[2024-05-12 11:40:13,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 459 flow
[2024-05-12 11:40:13,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:40:13,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:40:13,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions.
[2024-05-12 11:40:13,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5647058823529412
[2024-05-12 11:40:13,263 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 243 flow. Second operand 5 states and 144 transitions.
[2024-05-12 11:40:13,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 459 flow
[2024-05-12 11:40:13,268 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 421 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-05-12 11:40:13,270 INFO  L231             Difference]: Finished difference. Result has 66 places, 65 transitions, 264 flow
[2024-05-12 11:40:13,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=66, PETRI_TRANSITIONS=65}
[2024-05-12 11:40:13,271 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-05-12 11:40:13,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 264 flow
[2024-05-12 11:40:13,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:13,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:13,272 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:13,272 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-12 11:40:13,272 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:13,272 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:13,272 INFO  L85        PathProgramCache]: Analyzing trace with hash 1664543294, now seen corresponding path program 1 times
[2024-05-12 11:40:13,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:13,273 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500932112]
[2024-05-12 11:40:13,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:13,273 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:13,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:29,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:29,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:29,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500932112]
[2024-05-12 11:40:29,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500932112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:29,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:29,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:40:29,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089535923]
[2024-05-12 11:40:29,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:29,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:40:29,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:29,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:40:29,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:40:29,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:40:29,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 264 flow. Second operand  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:29,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:29,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:40:29,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:32,718 INFO  L124   PetriNetUnfolderBase]: 4888/7533 cut-off events.
[2024-05-12 11:40:32,719 INFO  L125   PetriNetUnfolderBase]: For 6981/6981 co-relation queries the response was YES.
[2024-05-12 11:40:32,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20521 conditions, 7533 events. 4888/7533 cut-off events. For 6981/6981 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 46047 event pairs, 1754 based on Foata normal form. 2/7211 useless extension candidates. Maximal degree in co-relation 20500. Up to 6939 conditions per place. 
[2024-05-12 11:40:32,764 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 73 selfloop transitions, 14 changer transitions 0/99 dead transitions.
[2024-05-12 11:40:32,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 534 flow
[2024-05-12 11:40:32,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:40:32,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:40:32,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions.
[2024-05-12 11:40:32,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5490196078431373
[2024-05-12 11:40:32,767 INFO  L175             Difference]: Start difference. First operand has 66 places, 65 transitions, 264 flow. Second operand 6 states and 168 transitions.
[2024-05-12 11:40:32,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 534 flow
[2024-05-12 11:40:32,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 505 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-05-12 11:40:32,775 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 308 flow
[2024-05-12 11:40:32,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-05-12 11:40:32,776 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places.
[2024-05-12 11:40:32,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 308 flow
[2024-05-12 11:40:32,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:32,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:32,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:32,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-12 11:40:32,777 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:32,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:32,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1663727629, now seen corresponding path program 1 times
[2024-05-12 11:40:32,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:32,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878965916]
[2024-05-12 11:40:32,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:32,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:32,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:33,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:33,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:33,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878965916]
[2024-05-12 11:40:33,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878965916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:33,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:33,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:40:33,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423044208]
[2024-05-12 11:40:33,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:33,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:40:33,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:33,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:40:33,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:40:33,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51
[2024-05-12 11:40:33,210 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 308 flow. Second operand  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:33,210 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:33,210 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51
[2024-05-12 11:40:33,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:33,916 INFO  L124   PetriNetUnfolderBase]: 988/2262 cut-off events.
[2024-05-12 11:40:33,917 INFO  L125   PetriNetUnfolderBase]: For 3486/3742 co-relation queries the response was YES.
[2024-05-12 11:40:33,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2262 events. 988/2262 cut-off events. For 3486/3742 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18244 event pairs, 256 based on Foata normal form. 2/2113 useless extension candidates. Maximal degree in co-relation 5327. Up to 1138 conditions per place. 
[2024-05-12 11:40:33,932 INFO  L140   encePairwiseOnDemand]: 48/51 looper letters, 27 selfloop transitions, 8 changer transitions 0/70 dead transitions.
[2024-05-12 11:40:33,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 344 flow
[2024-05-12 11:40:33,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:40:33,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:40:33,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2024-05-12 11:40:33,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7450980392156863
[2024-05-12 11:40:33,934 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 308 flow. Second operand 3 states and 114 transitions.
[2024-05-12 11:40:33,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 344 flow
[2024-05-12 11:40:33,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 314 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-05-12 11:40:33,937 INFO  L231             Difference]: Finished difference. Result has 66 places, 62 transitions, 244 flow
[2024-05-12 11:40:33,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=66, PETRI_TRANSITIONS=62}
[2024-05-12 11:40:33,938 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-05-12 11:40:33,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 244 flow
[2024-05-12 11:40:33,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:33,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:33,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:33,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-12 11:40:33,939 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:33,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:33,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 61020559, now seen corresponding path program 1 times
[2024-05-12 11:40:33,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:33,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323323484]
[2024-05-12 11:40:33,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:33,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:33,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:46,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:46,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:46,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323323484]
[2024-05-12 11:40:46,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323323484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:46,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:46,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:40:46,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046410021]
[2024-05-12 11:40:46,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:46,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:40:46,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:46,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:40:46,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:40:46,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:40:46,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 244 flow. Second operand  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:46,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:46,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:40:46,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:49,587 INFO  L124   PetriNetUnfolderBase]: 4648/7071 cut-off events.
[2024-05-12 11:40:49,587 INFO  L125   PetriNetUnfolderBase]: For 12010/12014 co-relation queries the response was YES.
[2024-05-12 11:40:49,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19903 conditions, 7071 events. 4648/7071 cut-off events. For 12010/12014 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 42180 event pairs, 1549 based on Foata normal form. 6/7060 useless extension candidates. Maximal degree in co-relation 19882. Up to 6563 conditions per place. 
[2024-05-12 11:40:49,624 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 74 selfloop transitions, 16 changer transitions 0/103 dead transitions.
[2024-05-12 11:40:49,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 568 flow
[2024-05-12 11:40:49,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:40:49,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:40:49,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions.
[2024-05-12 11:40:49,626 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5588235294117647
[2024-05-12 11:40:49,627 INFO  L175             Difference]: Start difference. First operand has 66 places, 62 transitions, 244 flow. Second operand 6 states and 171 transitions.
[2024-05-12 11:40:49,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 568 flow
[2024-05-12 11:40:49,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-05-12 11:40:49,634 INFO  L231             Difference]: Finished difference. Result has 70 places, 68 transitions, 314 flow
[2024-05-12 11:40:49,635 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=70, PETRI_TRANSITIONS=68}
[2024-05-12 11:40:49,636 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places.
[2024-05-12 11:40:49,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 314 flow
[2024-05-12 11:40:49,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:49,636 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:49,636 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:49,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-05-12 11:40:49,637 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:49,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:49,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 977301199, now seen corresponding path program 2 times
[2024-05-12 11:40:49,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:49,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210821959]
[2024-05-12 11:40:49,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:49,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:49,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:07,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:07,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:07,328 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210821959]
[2024-05-12 11:41:07,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210821959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:07,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:07,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:41:07,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406414044]
[2024-05-12 11:41:07,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:07,330 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:41:07,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:07,330 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:41:07,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:41:07,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:41:07,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 314 flow. Second operand  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:07,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:07,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:41:07,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:10,217 INFO  L124   PetriNetUnfolderBase]: 4643/7065 cut-off events.
[2024-05-12 11:41:10,217 INFO  L125   PetriNetUnfolderBase]: For 14411/14416 co-relation queries the response was YES.
[2024-05-12 11:41:10,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20893 conditions, 7065 events. 4643/7065 cut-off events. For 14411/14416 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 42239 event pairs, 1552 based on Foata normal form. 6/7053 useless extension candidates. Maximal degree in co-relation 20870. Up to 6558 conditions per place. 
[2024-05-12 11:41:10,256 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 69 selfloop transitions, 16 changer transitions 0/98 dead transitions.
[2024-05-12 11:41:10,256 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 552 flow
[2024-05-12 11:41:10,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:41:10,257 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:41:10,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions.
[2024-05-12 11:41:10,258 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5424836601307189
[2024-05-12 11:41:10,258 INFO  L175             Difference]: Start difference. First operand has 70 places, 68 transitions, 314 flow. Second operand 6 states and 166 transitions.
[2024-05-12 11:41:10,258 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 552 flow
[2024-05-12 11:41:10,271 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 518 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-05-12 11:41:10,273 INFO  L231             Difference]: Finished difference. Result has 74 places, 68 transitions, 320 flow
[2024-05-12 11:41:10,273 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=74, PETRI_TRANSITIONS=68}
[2024-05-12 11:41:10,274 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places.
[2024-05-12 11:41:10,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 320 flow
[2024-05-12 11:41:10,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:10,274 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:10,274 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:10,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-05-12 11:41:10,275 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:10,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:10,275 INFO  L85        PathProgramCache]: Analyzing trace with hash 61235885, now seen corresponding path program 1 times
[2024-05-12 11:41:10,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:10,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500568854]
[2024-05-12 11:41:10,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:10,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:10,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:27,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:27,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:27,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500568854]
[2024-05-12 11:41:27,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500568854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:27,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:27,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:41:27,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052220597]
[2024-05-12 11:41:27,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:27,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:41:27,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:27,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:41:27,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:41:27,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:41:27,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 320 flow. Second operand  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:27,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:27,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:41:27,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:30,530 INFO  L124   PetriNetUnfolderBase]: 4197/6640 cut-off events.
[2024-05-12 11:41:30,531 INFO  L125   PetriNetUnfolderBase]: For 13068/13068 co-relation queries the response was YES.
[2024-05-12 11:41:30,542 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19191 conditions, 6640 events. 4197/6640 cut-off events. For 13068/13068 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 41004 event pairs, 1357 based on Foata normal form. 4/6631 useless extension candidates. Maximal degree in co-relation 19166. Up to 5934 conditions per place. 
[2024-05-12 11:41:30,565 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 80 selfloop transitions, 14 changer transitions 5/111 dead transitions.
[2024-05-12 11:41:30,565 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 632 flow
[2024-05-12 11:41:30,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:41:30,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:41:30,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions.
[2024-05-12 11:41:30,568 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378151260504201
[2024-05-12 11:41:30,568 INFO  L175             Difference]: Start difference. First operand has 74 places, 68 transitions, 320 flow. Second operand 7 states and 192 transitions.
[2024-05-12 11:41:30,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 632 flow
[2024-05-12 11:41:30,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 588 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-05-12 11:41:30,578 INFO  L231             Difference]: Finished difference. Result has 75 places, 70 transitions, 340 flow
[2024-05-12 11:41:30,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=75, PETRI_TRANSITIONS=70}
[2024-05-12 11:41:30,580 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places.
[2024-05-12 11:41:30,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 340 flow
[2024-05-12 11:41:30,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:30,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:30,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:30,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-05-12 11:41:30,581 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:30,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:30,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 1891633785, now seen corresponding path program 1 times
[2024-05-12 11:41:30,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:30,587 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100572159]
[2024-05-12 11:41:30,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:30,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:30,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:48,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:48,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:48,340 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100572159]
[2024-05-12 11:41:48,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100572159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:48,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:48,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:41:48,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330768719]
[2024-05-12 11:41:48,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:48,341 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:41:48,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:48,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:41:48,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:41:48,545 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:41:48,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 340 flow. Second operand  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:48,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:48,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:41:48,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:51,331 INFO  L124   PetriNetUnfolderBase]: 4070/6249 cut-off events.
[2024-05-12 11:41:51,331 INFO  L125   PetriNetUnfolderBase]: For 17850/17850 co-relation queries the response was YES.
[2024-05-12 11:41:51,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19604 conditions, 6249 events. 4070/6249 cut-off events. For 17850/17850 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 36975 event pairs, 1288 based on Foata normal form. 2/6237 useless extension candidates. Maximal degree in co-relation 19579. Up to 5774 conditions per place. 
[2024-05-12 11:41:51,369 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 87 selfloop transitions, 14 changer transitions 0/114 dead transitions.
[2024-05-12 11:41:51,369 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 114 transitions, 664 flow
[2024-05-12 11:41:51,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:41:51,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:41:51,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions.
[2024-05-12 11:41:51,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378151260504201
[2024-05-12 11:41:51,372 INFO  L175             Difference]: Start difference. First operand has 75 places, 70 transitions, 340 flow. Second operand 7 states and 192 transitions.
[2024-05-12 11:41:51,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 114 transitions, 664 flow
[2024-05-12 11:41:51,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 622 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-05-12 11:41:51,384 INFO  L231             Difference]: Finished difference. Result has 76 places, 73 transitions, 366 flow
[2024-05-12 11:41:51,385 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=76, PETRI_TRANSITIONS=73}
[2024-05-12 11:41:51,387 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places.
[2024-05-12 11:41:51,388 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 366 flow
[2024-05-12 11:41:51,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:51,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:51,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:51,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-05-12 11:41:51,389 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:51,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:51,390 INFO  L85        PathProgramCache]: Analyzing trace with hash -175941525, now seen corresponding path program 2 times
[2024-05-12 11:41:51,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:51,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323448663]
[2024-05-12 11:41:51,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:51,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:51,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:09,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:09,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:09,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323448663]
[2024-05-12 11:42:09,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323448663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:09,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:09,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:42:09,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710526635]
[2024-05-12 11:42:09,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:09,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:42:09,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:09,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:42:09,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:42:09,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:42:09,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 366 flow. Second operand  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:09,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:09,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:42:09,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:12,600 INFO  L124   PetriNetUnfolderBase]: 4091/6298 cut-off events.
[2024-05-12 11:42:12,600 INFO  L125   PetriNetUnfolderBase]: For 22345/22349 co-relation queries the response was YES.
[2024-05-12 11:42:12,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20706 conditions, 6298 events. 4091/6298 cut-off events. For 22345/22349 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37401 event pairs, 1294 based on Foata normal form. 6/6289 useless extension candidates. Maximal degree in co-relation 20680. Up to 5717 conditions per place. 
[2024-05-12 11:42:12,627 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 80 selfloop transitions, 26 changer transitions 0/119 dead transitions.
[2024-05-12 11:42:12,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 119 transitions, 770 flow
[2024-05-12 11:42:12,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:42:12,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:42:12,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions.
[2024-05-12 11:42:12,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5462184873949579
[2024-05-12 11:42:12,629 INFO  L175             Difference]: Start difference. First operand has 76 places, 73 transitions, 366 flow. Second operand 7 states and 195 transitions.
[2024-05-12 11:42:12,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 119 transitions, 770 flow
[2024-05-12 11:42:12,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 726 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-05-12 11:42:12,640 INFO  L231             Difference]: Finished difference. Result has 78 places, 79 transitions, 452 flow
[2024-05-12 11:42:12,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=78, PETRI_TRANSITIONS=79}
[2024-05-12 11:42:12,641 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places.
[2024-05-12 11:42:12,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 452 flow
[2024-05-12 11:42:12,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:12,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:12,641 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:12,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-05-12 11:42:12,642 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:12,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:12,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 1720936191, now seen corresponding path program 1 times
[2024-05-12 11:42:12,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:12,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253437875]
[2024-05-12 11:42:12,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:12,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:12,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:29,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:29,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:29,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253437875]
[2024-05-12 11:42:29,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253437875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:29,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:29,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:42:29,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396730971]
[2024-05-12 11:42:29,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:29,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:42:29,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:29,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:42:29,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:42:30,051 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:42:30,051 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 452 flow. Second operand  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:30,051 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:30,051 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:42:30,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:33,135 INFO  L124   PetriNetUnfolderBase]: 4356/6571 cut-off events.
[2024-05-12 11:42:33,136 INFO  L125   PetriNetUnfolderBase]: For 27793/27797 co-relation queries the response was YES.
[2024-05-12 11:42:33,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22696 conditions, 6571 events. 4356/6571 cut-off events. For 27793/27797 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37994 event pairs, 1400 based on Foata normal form. 6/6561 useless extension candidates. Maximal degree in co-relation 22669. Up to 6095 conditions per place. 
[2024-05-12 11:42:33,167 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 105 selfloop transitions, 25 changer transitions 0/141 dead transitions.
[2024-05-12 11:42:33,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 936 flow
[2024-05-12 11:42:33,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:42:33,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:42:33,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions.
[2024-05-12 11:42:33,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5163398692810458
[2024-05-12 11:42:33,169 INFO  L175             Difference]: Start difference. First operand has 78 places, 79 transitions, 452 flow. Second operand 9 states and 237 transitions.
[2024-05-12 11:42:33,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 936 flow
[2024-05-12 11:42:33,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 894 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-05-12 11:42:33,185 INFO  L231             Difference]: Finished difference. Result has 84 places, 85 transitions, 530 flow
[2024-05-12 11:42:33,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=530, PETRI_PLACES=84, PETRI_TRANSITIONS=85}
[2024-05-12 11:42:33,186 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places.
[2024-05-12 11:42:33,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 530 flow
[2024-05-12 11:42:33,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:33,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:33,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:33,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-05-12 11:42:33,187 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:33,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:33,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 231567389, now seen corresponding path program 2 times
[2024-05-12 11:42:33,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:33,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347675009]
[2024-05-12 11:42:33,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:33,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:33,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:50,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:50,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:50,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347675009]
[2024-05-12 11:42:50,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347675009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:50,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:50,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:42:50,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757854514]
[2024-05-12 11:42:50,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:50,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:42:50,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:50,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:42:50,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:42:50,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:42:50,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 530 flow. Second operand  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:50,951 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:50,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:42:50,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:53,884 INFO  L124   PetriNetUnfolderBase]: 4379/6604 cut-off events.
[2024-05-12 11:42:53,885 INFO  L125   PetriNetUnfolderBase]: For 32601/32606 co-relation queries the response was YES.
[2024-05-12 11:42:53,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23970 conditions, 6604 events. 4379/6604 cut-off events. For 32601/32606 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 38104 event pairs, 1403 based on Foata normal form. 6/6593 useless extension candidates. Maximal degree in co-relation 23941. Up to 6119 conditions per place. 
[2024-05-12 11:42:53,920 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 102 selfloop transitions, 28 changer transitions 0/141 dead transitions.
[2024-05-12 11:42:53,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 141 transitions, 988 flow
[2024-05-12 11:42:53,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:42:53,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:42:53,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions.
[2024-05-12 11:42:53,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5119825708061002
[2024-05-12 11:42:53,922 INFO  L175             Difference]: Start difference. First operand has 84 places, 85 transitions, 530 flow. Second operand 9 states and 235 transitions.
[2024-05-12 11:42:53,922 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 141 transitions, 988 flow
[2024-05-12 11:42:53,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 141 transitions, 930 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-05-12 11:42:53,941 INFO  L231             Difference]: Finished difference. Result has 88 places, 88 transitions, 570 flow
[2024-05-12 11:42:53,942 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=570, PETRI_PLACES=88, PETRI_TRANSITIONS=88}
[2024-05-12 11:42:53,942 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places.
[2024-05-12 11:42:53,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 570 flow
[2024-05-12 11:42:53,943 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:53,943 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:53,943 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:53,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-05-12 11:42:53,943 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:53,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:53,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1898067525, now seen corresponding path program 3 times
[2024-05-12 11:42:53,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:53,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038205501]
[2024-05-12 11:42:53,944 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:53,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:53,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:11,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:11,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:11,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038205501]
[2024-05-12 11:43:11,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038205501] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:11,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:11,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:43:11,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19499478]
[2024-05-12 11:43:11,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:11,228 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:43:11,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:11,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:43:11,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:43:11,403 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:43:11,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 570 flow. Second operand  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:11,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:11,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:43:11,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:14,187 INFO  L124   PetriNetUnfolderBase]: 4143/6364 cut-off events.
[2024-05-12 11:43:14,188 INFO  L125   PetriNetUnfolderBase]: For 35073/35076 co-relation queries the response was YES.
[2024-05-12 11:43:14,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23300 conditions, 6364 events. 4143/6364 cut-off events. For 35073/35076 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37648 event pairs, 1298 based on Foata normal form. 2/6347 useless extension candidates. Maximal degree in co-relation 23269. Up to 5767 conditions per place. 
[2024-05-12 11:43:14,219 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 81 selfloop transitions, 26 changer transitions 0/123 dead transitions.
[2024-05-12 11:43:14,219 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 864 flow
[2024-05-12 11:43:14,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:43:14,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:43:14,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions.
[2024-05-12 11:43:14,222 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5322128851540616
[2024-05-12 11:43:14,222 INFO  L175             Difference]: Start difference. First operand has 88 places, 88 transitions, 570 flow. Second operand 7 states and 190 transitions.
[2024-05-12 11:43:14,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 864 flow
[2024-05-12 11:43:14,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 774 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-05-12 11:43:14,244 INFO  L231             Difference]: Finished difference. Result has 88 places, 88 transitions, 540 flow
[2024-05-12 11:43:14,245 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=88, PETRI_TRANSITIONS=88}
[2024-05-12 11:43:14,245 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places.
[2024-05-12 11:43:14,245 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 540 flow
[2024-05-12 11:43:14,246 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:14,246 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:14,246 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:14,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-05-12 11:43:14,246 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:14,246 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:14,246 INFO  L85        PathProgramCache]: Analyzing trace with hash 1898074221, now seen corresponding path program 3 times
[2024-05-12 11:43:14,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:14,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863875458]
[2024-05-12 11:43:14,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:14,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:14,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:31,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:31,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:31,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863875458]
[2024-05-12 11:43:31,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863875458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:31,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:31,853 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:43:31,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253596228]
[2024-05-12 11:43:31,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:31,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:43:31,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:31,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:43:31,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:43:32,042 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:43:32,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 540 flow. Second operand  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:32,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:32,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:43:32,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:34,748 INFO  L124   PetriNetUnfolderBase]: 4369/6590 cut-off events.
[2024-05-12 11:43:34,748 INFO  L125   PetriNetUnfolderBase]: For 37932/37937 co-relation queries the response was YES.
[2024-05-12 11:43:34,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24345 conditions, 6590 events. 4369/6590 cut-off events. For 37932/37937 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 38021 event pairs, 1403 based on Foata normal form. 6/6579 useless extension candidates. Maximal degree in co-relation 24313. Up to 6107 conditions per place. 
[2024-05-12 11:43:34,782 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 85 selfloop transitions, 27 changer transitions 0/123 dead transitions.
[2024-05-12 11:43:34,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 844 flow
[2024-05-12 11:43:34,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:43:34,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:43:34,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions.
[2024-05-12 11:43:34,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5126050420168067
[2024-05-12 11:43:34,783 INFO  L175             Difference]: Start difference. First operand has 88 places, 88 transitions, 540 flow. Second operand 7 states and 183 transitions.
[2024-05-12 11:43:34,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 844 flow
[2024-05-12 11:43:34,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 760 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-05-12 11:43:34,802 INFO  L231             Difference]: Finished difference. Result has 89 places, 88 transitions, 518 flow
[2024-05-12 11:43:34,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=89, PETRI_TRANSITIONS=88}
[2024-05-12 11:43:34,803 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places.
[2024-05-12 11:43:34,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 518 flow
[2024-05-12 11:43:34,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:34,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:34,803 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:34,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-05-12 11:43:34,804 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:34,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:34,804 INFO  L85        PathProgramCache]: Analyzing trace with hash 1113921730, now seen corresponding path program 1 times
[2024-05-12 11:43:34,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:34,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045996596]
[2024-05-12 11:43:34,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:34,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:34,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:51,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:51,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:51,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045996596]
[2024-05-12 11:43:51,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045996596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:51,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:51,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:43:51,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350221027]
[2024-05-12 11:43:51,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:51,313 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:43:51,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:51,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:43:51,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:43:51,532 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51
[2024-05-12 11:43:51,532 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 518 flow. Second operand  has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:51,532 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:51,532 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51
[2024-05-12 11:43:51,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:53,635 INFO  L124   PetriNetUnfolderBase]: 3278/5861 cut-off events.
[2024-05-12 11:43:53,635 INFO  L125   PetriNetUnfolderBase]: For 35580/35596 co-relation queries the response was YES.
[2024-05-12 11:43:53,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20181 conditions, 5861 events. 3278/5861 cut-off events. For 35580/35596 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 41324 event pairs, 1482 based on Foata normal form. 5/5671 useless extension candidates. Maximal degree in co-relation 20148. Up to 4729 conditions per place. 
[2024-05-12 11:43:53,669 INFO  L140   encePairwiseOnDemand]: 43/51 looper letters, 76 selfloop transitions, 9 changer transitions 0/109 dead transitions.
[2024-05-12 11:43:53,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 109 transitions, 765 flow
[2024-05-12 11:43:53,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:43:53,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:43:53,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions.
[2024-05-12 11:43:53,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5372549019607843
[2024-05-12 11:43:53,670 INFO  L175             Difference]: Start difference. First operand has 89 places, 88 transitions, 518 flow. Second operand 5 states and 137 transitions.
[2024-05-12 11:43:53,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 109 transitions, 765 flow
[2024-05-12 11:43:53,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 707 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-05-12 11:43:53,689 INFO  L231             Difference]: Finished difference. Result has 89 places, 95 transitions, 548 flow
[2024-05-12 11:43:53,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=89, PETRI_TRANSITIONS=95}
[2024-05-12 11:43:53,689 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places.
[2024-05-12 11:43:53,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 548 flow
[2024-05-12 11:43:53,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:43:53,690 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:53,690 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:53,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-05-12 11:43:53,690 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:53,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:53,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 967016935, now seen corresponding path program 1 times
[2024-05-12 11:43:53,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:53,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296035042]
[2024-05-12 11:43:53,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:53,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:53,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:12,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:12,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:12,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296035042]
[2024-05-12 11:44:12,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296035042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:12,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:12,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:44:12,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929452687]
[2024-05-12 11:44:12,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:12,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:44:12,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:12,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:44:12,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:44:12,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:44:12,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 548 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:12,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:12,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:44:12,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:15,987 INFO  L124   PetriNetUnfolderBase]: 4394/7218 cut-off events.
[2024-05-12 11:44:15,987 INFO  L125   PetriNetUnfolderBase]: For 46377/46377 co-relation queries the response was YES.
[2024-05-12 11:44:16,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26430 conditions, 7218 events. 4394/7218 cut-off events. For 46377/46377 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 46517 event pairs, 1633 based on Foata normal form. 2/7011 useless extension candidates. Maximal degree in co-relation 26395. Up to 6204 conditions per place. 
[2024-05-12 11:44:16,022 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 115 selfloop transitions, 20 changer transitions 0/146 dead transitions.
[2024-05-12 11:44:16,022 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 146 transitions, 974 flow
[2024-05-12 11:44:16,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:44:16,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:44:16,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions.
[2024-05-12 11:44:16,023 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5171568627450981
[2024-05-12 11:44:16,024 INFO  L175             Difference]: Start difference. First operand has 89 places, 95 transitions, 548 flow. Second operand 8 states and 211 transitions.
[2024-05-12 11:44:16,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 146 transitions, 974 flow
[2024-05-12 11:44:16,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 146 transitions, 951 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-05-12 11:44:16,049 INFO  L231             Difference]: Finished difference. Result has 95 places, 98 transitions, 615 flow
[2024-05-12 11:44:16,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=615, PETRI_PLACES=95, PETRI_TRANSITIONS=98}
[2024-05-12 11:44:16,050 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places.
[2024-05-12 11:44:16,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 615 flow
[2024-05-12 11:44:16,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:16,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:16,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:16,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-05-12 11:44:16,051 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:16,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:16,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1159218687, now seen corresponding path program 2 times
[2024-05-12 11:44:16,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:16,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540781567]
[2024-05-12 11:44:16,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:16,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:16,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:34,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:34,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:34,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540781567]
[2024-05-12 11:44:34,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540781567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:34,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:34,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:44:34,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959901663]
[2024-05-12 11:44:34,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:34,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:44:34,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:34,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:44:34,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:44:34,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:44:34,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 615 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:34,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:34,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:44:34,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:38,048 INFO  L124   PetriNetUnfolderBase]: 4445/7192 cut-off events.
[2024-05-12 11:44:38,048 INFO  L125   PetriNetUnfolderBase]: For 54247/54249 co-relation queries the response was YES.
[2024-05-12 11:44:38,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27880 conditions, 7192 events. 4445/7192 cut-off events. For 54247/54249 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 45370 event pairs, 1547 based on Foata normal form. 4/7022 useless extension candidates. Maximal degree in co-relation 27843. Up to 6049 conditions per place. 
[2024-05-12 11:44:38,091 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 128 selfloop transitions, 50 changer transitions 0/189 dead transitions.
[2024-05-12 11:44:38,091 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 189 transitions, 1425 flow
[2024-05-12 11:44:38,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-05-12 11:44:38,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-05-12 11:44:38,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 318 transitions.
[2024-05-12 11:44:38,093 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5196078431372549
[2024-05-12 11:44:38,093 INFO  L175             Difference]: Start difference. First operand has 95 places, 98 transitions, 615 flow. Second operand 12 states and 318 transitions.
[2024-05-12 11:44:38,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 189 transitions, 1425 flow
[2024-05-12 11:44:38,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 189 transitions, 1359 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-05-12 11:44:38,119 INFO  L231             Difference]: Finished difference. Result has 101 places, 107 transitions, 789 flow
[2024-05-12 11:44:38,119 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=789, PETRI_PLACES=101, PETRI_TRANSITIONS=107}
[2024-05-12 11:44:38,120 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places.
[2024-05-12 11:44:38,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 107 transitions, 789 flow
[2024-05-12 11:44:38,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:38,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:38,120 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:38,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-05-12 11:44:38,121 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:38,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:38,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1809415692, now seen corresponding path program 1 times
[2024-05-12 11:44:38,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:38,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083912583]
[2024-05-12 11:44:38,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:38,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:38,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:56,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:56,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:56,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083912583]
[2024-05-12 11:44:56,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083912583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:56,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:56,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:44:56,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901201208]
[2024-05-12 11:44:56,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:56,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:44:56,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:56,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:44:56,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:44:56,983 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:44:56,983 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 107 transitions, 789 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:56,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:56,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:44:56,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:00,252 INFO  L124   PetriNetUnfolderBase]: 4491/7262 cut-off events.
[2024-05-12 11:45:00,252 INFO  L125   PetriNetUnfolderBase]: For 63444/63446 co-relation queries the response was YES.
[2024-05-12 11:45:00,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29369 conditions, 7262 events. 4491/7262 cut-off events. For 63444/63446 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45729 event pairs, 1415 based on Foata normal form. 6/7091 useless extension candidates. Maximal degree in co-relation 29331. Up to 6142 conditions per place. 
[2024-05-12 11:45:00,304 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 133 selfloop transitions, 36 changer transitions 0/180 dead transitions.
[2024-05-12 11:45:00,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 180 transitions, 1431 flow
[2024-05-12 11:45:00,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:45:00,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:45:00,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions.
[2024-05-12 11:45:00,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5235294117647059
[2024-05-12 11:45:00,307 INFO  L175             Difference]: Start difference. First operand has 101 places, 107 transitions, 789 flow. Second operand 10 states and 267 transitions.
[2024-05-12 11:45:00,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 180 transitions, 1431 flow
[2024-05-12 11:45:00,345 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 180 transitions, 1332 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-05-12 11:45:00,347 INFO  L231             Difference]: Finished difference. Result has 104 places, 113 transitions, 848 flow
[2024-05-12 11:45:00,347 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=848, PETRI_PLACES=104, PETRI_TRANSITIONS=113}
[2024-05-12 11:45:00,348 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2024-05-12 11:45:00,348 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 113 transitions, 848 flow
[2024-05-12 11:45:00,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:00,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:00,348 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:00,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-05-12 11:45:00,349 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:00,349 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:00,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 111265365, now seen corresponding path program 3 times
[2024-05-12 11:45:00,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:00,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515572489]
[2024-05-12 11:45:00,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:00,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:00,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:17,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:45:17,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:17,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515572489]
[2024-05-12 11:45:17,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515572489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:17,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:17,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:45:17,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262366711]
[2024-05-12 11:45:17,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:17,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:45:17,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:17,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:45:17,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:45:18,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:45:18,138 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 113 transitions, 848 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:18,138 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:18,138 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:45:18,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:21,221 INFO  L124   PetriNetUnfolderBase]: 4486/7252 cut-off events.
[2024-05-12 11:45:21,221 INFO  L125   PetriNetUnfolderBase]: For 69213/69215 co-relation queries the response was YES.
[2024-05-12 11:45:21,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30330 conditions, 7252 events. 4486/7252 cut-off events. For 69213/69215 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 45684 event pairs, 1502 based on Foata normal form. 4/7080 useless extension candidates. Maximal degree in co-relation 30290. Up to 6108 conditions per place. 
[2024-05-12 11:45:21,263 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 117 selfloop transitions, 49 changer transitions 0/177 dead transitions.
[2024-05-12 11:45:21,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 177 transitions, 1410 flow
[2024-05-12 11:45:21,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:45:21,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:45:21,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions.
[2024-05-12 11:45:21,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5215686274509804
[2024-05-12 11:45:21,266 INFO  L175             Difference]: Start difference. First operand has 104 places, 113 transitions, 848 flow. Second operand 10 states and 266 transitions.
[2024-05-12 11:45:21,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 177 transitions, 1410 flow
[2024-05-12 11:45:21,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 1315 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-05-12 11:45:21,309 INFO  L231             Difference]: Finished difference. Result has 108 places, 113 transitions, 859 flow
[2024-05-12 11:45:21,309 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=859, PETRI_PLACES=108, PETRI_TRANSITIONS=113}
[2024-05-12 11:45:21,309 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2024-05-12 11:45:21,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 113 transitions, 859 flow
[2024-05-12 11:45:21,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:21,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:21,310 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:21,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-05-12 11:45:21,311 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:21,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:21,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1411350007, now seen corresponding path program 4 times
[2024-05-12 11:45:21,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:21,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496790730]
[2024-05-12 11:45:21,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:21,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:21,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:39,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:45:39,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:39,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496790730]
[2024-05-12 11:45:39,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496790730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:39,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:39,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:45:39,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426209620]
[2024-05-12 11:45:39,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:39,511 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:45:39,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:39,511 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:45:39,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:45:39,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:45:39,757 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 859 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:39,757 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:39,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:45:39,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:43,050 INFO  L124   PetriNetUnfolderBase]: 4509/6928 cut-off events.
[2024-05-12 11:45:43,051 INFO  L125   PetriNetUnfolderBase]: For 72698/72701 co-relation queries the response was YES.
[2024-05-12 11:45:43,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30463 conditions, 6928 events. 4509/6928 cut-off events. For 72698/72701 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 41171 event pairs, 1368 based on Foata normal form. 2/6881 useless extension candidates. Maximal degree in co-relation 30421. Up to 6132 conditions per place. 
[2024-05-12 11:45:43,093 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 120 selfloop transitions, 54 changer transitions 0/185 dead transitions.
[2024-05-12 11:45:43,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 185 transitions, 1501 flow
[2024-05-12 11:45:43,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:45:43,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:45:43,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 288 transitions.
[2024-05-12 11:45:43,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5133689839572193
[2024-05-12 11:45:43,095 INFO  L175             Difference]: Start difference. First operand has 108 places, 113 transitions, 859 flow. Second operand 11 states and 288 transitions.
[2024-05-12 11:45:43,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 185 transitions, 1501 flow
[2024-05-12 11:45:43,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 185 transitions, 1397 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-05-12 11:45:43,131 INFO  L231             Difference]: Finished difference. Result has 110 places, 116 transitions, 919 flow
[2024-05-12 11:45:43,131 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=919, PETRI_PLACES=110, PETRI_TRANSITIONS=116}
[2024-05-12 11:45:43,131 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places.
[2024-05-12 11:45:43,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 919 flow
[2024-05-12 11:45:43,132 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:43,132 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:43,132 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:43,132 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-05-12 11:45:43,132 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:43,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:43,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282090347, now seen corresponding path program 5 times
[2024-05-12 11:45:43,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:43,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113417821]
[2024-05-12 11:45:43,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:43,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:43,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:46:01,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:46:01,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:46:01,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113417821]
[2024-05-12 11:46:01,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113417821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:46:01,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:46:01,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:46:01,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689967304]
[2024-05-12 11:46:01,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:46:01,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:46:01,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:46:01,894 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:46:01,894 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:46:02,114 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:46:02,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 919 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:02,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:46:02,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:46:02,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:05,070 INFO  L124   PetriNetUnfolderBase]: 4532/6983 cut-off events.
[2024-05-12 11:46:05,070 INFO  L125   PetriNetUnfolderBase]: For 78041/78044 co-relation queries the response was YES.
[2024-05-12 11:46:05,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31004 conditions, 6983 events. 4532/6983 cut-off events. For 78041/78044 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 41761 event pairs, 1373 based on Foata normal form. 2/6931 useless extension candidates. Maximal degree in co-relation 30961. Up to 6156 conditions per place. 
[2024-05-12 11:46:05,111 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 99 selfloop transitions, 54 changer transitions 0/164 dead transitions.
[2024-05-12 11:46:05,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 164 transitions, 1463 flow
[2024-05-12 11:46:05,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:46:05,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:46:05,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions.
[2024-05-12 11:46:05,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5220588235294118
[2024-05-12 11:46:05,113 INFO  L175             Difference]: Start difference. First operand has 110 places, 116 transitions, 919 flow. Second operand 8 states and 213 transitions.
[2024-05-12 11:46:05,113 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 164 transitions, 1463 flow
[2024-05-12 11:46:05,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 164 transitions, 1307 flow, removed 19 selfloop flow, removed 9 redundant places.
[2024-05-12 11:46:05,153 INFO  L231             Difference]: Finished difference. Result has 109 places, 119 transitions, 927 flow
[2024-05-12 11:46:05,154 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=927, PETRI_PLACES=109, PETRI_TRANSITIONS=119}
[2024-05-12 11:46:05,154 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 52 predicate places.
[2024-05-12 11:46:05,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 119 transitions, 927 flow
[2024-05-12 11:46:05,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:05,155 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:05,155 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:05,155 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-05-12 11:46:05,155 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:05,155 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:05,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -1289441780, now seen corresponding path program 2 times
[2024-05-12 11:46:05,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:05,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933100213]
[2024-05-12 11:46:05,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:05,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:05,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:46:24,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:46:24,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:46:24,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933100213]
[2024-05-12 11:46:24,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933100213] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:46:24,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:46:24,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:46:24,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041708451]
[2024-05-12 11:46:24,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:46:24,035 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:46:24,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:46:24,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:46:24,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:46:24,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:46:24,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 119 transitions, 927 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:24,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:46:24,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:46:24,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:27,439 INFO  L124   PetriNetUnfolderBase]: 4578/7031 cut-off events.
[2024-05-12 11:46:27,439 INFO  L125   PetriNetUnfolderBase]: For 83554/83559 co-relation queries the response was YES.
[2024-05-12 11:46:27,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31420 conditions, 7031 events. 4578/7031 cut-off events. For 83554/83559 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 41751 event pairs, 1267 based on Foata normal form. 8/6993 useless extension candidates. Maximal degree in co-relation 31376. Up to 6238 conditions per place. 
[2024-05-12 11:46:27,484 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 136 selfloop transitions, 39 changer transitions 0/186 dead transitions.
[2024-05-12 11:46:27,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 186 transitions, 1553 flow
[2024-05-12 11:46:27,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:46:27,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:46:27,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 265 transitions.
[2024-05-12 11:46:27,485 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5196078431372549
[2024-05-12 11:46:27,485 INFO  L175             Difference]: Start difference. First operand has 109 places, 119 transitions, 927 flow. Second operand 10 states and 265 transitions.
[2024-05-12 11:46:27,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 186 transitions, 1553 flow
[2024-05-12 11:46:27,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 186 transitions, 1451 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-05-12 11:46:27,650 INFO  L231             Difference]: Finished difference. Result has 114 places, 122 transitions, 947 flow
[2024-05-12 11:46:27,650 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=947, PETRI_PLACES=114, PETRI_TRANSITIONS=122}
[2024-05-12 11:46:27,650 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 57 predicate places.
[2024-05-12 11:46:27,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 947 flow
[2024-05-12 11:46:27,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:27,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:27,651 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:27,651 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-05-12 11:46:27,651 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:27,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:27,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -1281823220, now seen corresponding path program 3 times
[2024-05-12 11:46:27,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:27,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730043861]
[2024-05-12 11:46:27,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:27,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:27,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:46:48,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:46:48,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:46:48,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730043861]
[2024-05-12 11:46:48,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730043861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:46:48,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:46:48,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:46:48,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215912958]
[2024-05-12 11:46:48,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:46:48,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:46:48,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:46:48,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:46:48,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:46:48,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:46:48,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 122 transitions, 947 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:48,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:46:48,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:46:48,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:51,565 INFO  L124   PetriNetUnfolderBase]: 4624/7117 cut-off events.
[2024-05-12 11:46:51,565 INFO  L125   PetriNetUnfolderBase]: For 89766/89771 co-relation queries the response was YES.
[2024-05-12 11:46:51,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32012 conditions, 7117 events. 4624/7117 cut-off events. For 89766/89771 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 42496 event pairs, 1272 based on Foata normal form. 8/7075 useless extension candidates. Maximal degree in co-relation 31967. Up to 6277 conditions per place. 
[2024-05-12 11:46:51,615 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 118 selfloop transitions, 43 changer transitions 0/172 dead transitions.
[2024-05-12 11:46:51,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 172 transitions, 1513 flow
[2024-05-12 11:46:51,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:46:51,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:46:51,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions.
[2024-05-12 11:46:51,618 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5220588235294118
[2024-05-12 11:46:51,618 INFO  L175             Difference]: Start difference. First operand has 114 places, 122 transitions, 947 flow. Second operand 8 states and 213 transitions.
[2024-05-12 11:46:51,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 172 transitions, 1513 flow
[2024-05-12 11:46:51,679 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 172 transitions, 1403 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-05-12 11:46:51,682 INFO  L231             Difference]: Finished difference. Result has 114 places, 125 transitions, 973 flow
[2024-05-12 11:46:51,682 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=973, PETRI_PLACES=114, PETRI_TRANSITIONS=125}
[2024-05-12 11:46:51,682 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 57 predicate places.
[2024-05-12 11:46:51,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 125 transitions, 973 flow
[2024-05-12 11:46:51,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:46:51,683 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:51,683 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:51,683 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-05-12 11:46:51,683 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:51,683 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:51,683 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282090130, now seen corresponding path program 4 times
[2024-05-12 11:46:51,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:51,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447844197]
[2024-05-12 11:46:51,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:51,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:51,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:04,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:04,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:04,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447844197]
[2024-05-12 11:47:04,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447844197] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:04,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:04,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:47:04,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551096849]
[2024-05-12 11:47:04,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:04,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:47:04,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:04,520 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:47:04,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:47:04,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:47:04,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 125 transitions, 973 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:04,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:04,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:47:04,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:08,094 INFO  L124   PetriNetUnfolderBase]: 4614/7110 cut-off events.
[2024-05-12 11:47:08,094 INFO  L125   PetriNetUnfolderBase]: For 93609/93614 co-relation queries the response was YES.
[2024-05-12 11:47:08,113 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32016 conditions, 7110 events. 4614/7110 cut-off events. For 93609/93614 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 42556 event pairs, 1273 based on Foata normal form. 8/7065 useless extension candidates. Maximal degree in co-relation 31970. Up to 6269 conditions per place. 
[2024-05-12 11:47:08,136 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 119 selfloop transitions, 41 changer transitions 0/171 dead transitions.
[2024-05-12 11:47:08,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 171 transitions, 1407 flow
[2024-05-12 11:47:08,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:47:08,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:47:08,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions.
[2024-05-12 11:47:08,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5220588235294118
[2024-05-12 11:47:08,138 INFO  L175             Difference]: Start difference. First operand has 114 places, 125 transitions, 973 flow. Second operand 8 states and 213 transitions.
[2024-05-12 11:47:08,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 171 transitions, 1407 flow
[2024-05-12 11:47:08,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 171 transitions, 1293 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-05-12 11:47:08,196 INFO  L231             Difference]: Finished difference. Result has 117 places, 125 transitions, 949 flow
[2024-05-12 11:47:08,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=949, PETRI_PLACES=117, PETRI_TRANSITIONS=125}
[2024-05-12 11:47:08,197 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 60 predicate places.
[2024-05-12 11:47:08,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 125 transitions, 949 flow
[2024-05-12 11:47:08,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:08,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:08,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:08,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-05-12 11:47:08,197 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:08,198 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:08,198 INFO  L85        PathProgramCache]: Analyzing trace with hash -1015322577, now seen corresponding path program 6 times
[2024-05-12 11:47:08,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:08,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570464709]
[2024-05-12 11:47:08,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:08,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:08,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:27,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:27,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:27,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570464709]
[2024-05-12 11:47:27,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570464709] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:27,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:27,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:47:27,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237909836]
[2024-05-12 11:47:27,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:27,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:47:27,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:27,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:47:27,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:47:27,392 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:47:27,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 125 transitions, 949 flow. Second operand  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:27,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:27,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:47:27,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:30,495 INFO  L124   PetriNetUnfolderBase]: 4609/7101 cut-off events.
[2024-05-12 11:47:30,495 INFO  L125   PetriNetUnfolderBase]: For 97445/97448 co-relation queries the response was YES.
[2024-05-12 11:47:30,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31963 conditions, 7101 events. 4609/7101 cut-off events. For 97445/97448 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 42474 event pairs, 1378 based on Foata normal form. 2/7051 useless extension candidates. Maximal degree in co-relation 31916. Up to 6265 conditions per place. 
[2024-05-12 11:47:30,544 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 118 selfloop transitions, 55 changer transitions 0/184 dead transitions.
[2024-05-12 11:47:30,544 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 184 transitions, 1443 flow
[2024-05-12 11:47:30,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:47:30,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:47:30,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 264 transitions.
[2024-05-12 11:47:30,545 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5176470588235295
[2024-05-12 11:47:30,545 INFO  L175             Difference]: Start difference. First operand has 117 places, 125 transitions, 949 flow. Second operand 10 states and 264 transitions.
[2024-05-12 11:47:30,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 184 transitions, 1443 flow
[2024-05-12 11:47:30,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 1313 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-05-12 11:47:30,598 INFO  L231             Difference]: Finished difference. Result has 119 places, 125 transitions, 937 flow
[2024-05-12 11:47:30,598 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=937, PETRI_PLACES=119, PETRI_TRANSITIONS=125}
[2024-05-12 11:47:30,599 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 62 predicate places.
[2024-05-12 11:47:30,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 937 flow
[2024-05-12 11:47:30,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:30,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:30,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:30,600 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-05-12 11:47:30,600 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:30,600 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:30,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 187030843, now seen corresponding path program 1 times
[2024-05-12 11:47:30,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:30,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803071193]
[2024-05-12 11:47:30,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:30,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:30,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:48,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:48,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:48,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803071193]
[2024-05-12 11:47:48,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803071193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:48,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:48,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:47:48,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225556738]
[2024-05-12 11:47:48,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:48,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:47:48,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:48,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:47:48,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:47:48,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51
[2024-05-12 11:47:48,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 937 flow. Second operand  has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:48,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:48,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51
[2024-05-12 11:47:48,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:51,273 INFO  L124   PetriNetUnfolderBase]: 3995/6716 cut-off events.
[2024-05-12 11:47:51,273 INFO  L125   PetriNetUnfolderBase]: For 99960/99995 co-relation queries the response was YES.
[2024-05-12 11:47:51,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29094 conditions, 6716 events. 3995/6716 cut-off events. For 99960/99995 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 45312 event pairs, 1714 based on Foata normal form. 12/6606 useless extension candidates. Maximal degree in co-relation 29046. Up to 5696 conditions per place. 
[2024-05-12 11:47:51,326 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 102 selfloop transitions, 12 changer transitions 0/147 dead transitions.
[2024-05-12 11:47:51,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 1235 flow
[2024-05-12 11:47:51,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:47:51,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:47:51,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions.
[2024-05-12 11:47:51,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5130718954248366
[2024-05-12 11:47:51,327 INFO  L175             Difference]: Start difference. First operand has 119 places, 125 transitions, 937 flow. Second operand 6 states and 157 transitions.
[2024-05-12 11:47:51,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 1235 flow
[2024-05-12 11:47:51,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 147 transitions, 1093 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-05-12 11:47:51,394 INFO  L231             Difference]: Finished difference. Result has 115 places, 128 transitions, 855 flow
[2024-05-12 11:47:51,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=115, PETRI_TRANSITIONS=128}
[2024-05-12 11:47:51,395 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 58 predicate places.
[2024-05-12 11:47:51,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 128 transitions, 855 flow
[2024-05-12 11:47:51,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:51,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:51,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:51,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-05-12 11:47:51,395 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:51,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:51,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1694192696, now seen corresponding path program 1 times
[2024-05-12 11:47:51,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:51,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26579166]
[2024-05-12 11:47:51,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:51,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:51,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:48:11,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:48:11,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:48:11,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26579166]
[2024-05-12 11:48:11,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26579166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:48:11,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:48:11,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:48:11,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160514273]
[2024-05-12 11:48:11,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:48:11,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:48:11,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:48:11,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:48:11,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:48:11,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:48:11,565 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 128 transitions, 855 flow. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:11,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:48:11,566 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:48:11,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:48:14,888 INFO  L124   PetriNetUnfolderBase]: 4626/7654 cut-off events.
[2024-05-12 11:48:14,889 INFO  L125   PetriNetUnfolderBase]: For 127418/127432 co-relation queries the response was YES.
[2024-05-12 11:48:14,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34614 conditions, 7654 events. 4626/7654 cut-off events. For 127418/127432 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 50455 event pairs, 1117 based on Foata normal form. 6/7444 useless extension candidates. Maximal degree in co-relation 34565. Up to 6347 conditions per place. 
[2024-05-12 11:48:14,943 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 146 selfloop transitions, 23 changer transitions 0/192 dead transitions.
[2024-05-12 11:48:14,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 192 transitions, 1517 flow
[2024-05-12 11:48:14,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:48:14,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:48:14,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions.
[2024-05-12 11:48:14,944 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5381263616557734
[2024-05-12 11:48:14,944 INFO  L175             Difference]: Start difference. First operand has 115 places, 128 transitions, 855 flow. Second operand 9 states and 247 transitions.
[2024-05-12 11:48:14,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 192 transitions, 1517 flow
[2024-05-12 11:48:15,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 192 transitions, 1479 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-05-12 11:48:15,005 INFO  L231             Difference]: Finished difference. Result has 120 places, 132 transitions, 950 flow
[2024-05-12 11:48:15,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=950, PETRI_PLACES=120, PETRI_TRANSITIONS=132}
[2024-05-12 11:48:15,005 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 63 predicate places.
[2024-05-12 11:48:15,005 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 132 transitions, 950 flow
[2024-05-12 11:48:15,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:15,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:48:15,006 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:48:15,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-05-12 11:48:15,006 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:48:15,007 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:48:15,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -850386248, now seen corresponding path program 2 times
[2024-05-12 11:48:15,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:48:15,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895550281]
[2024-05-12 11:48:15,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:48:15,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:48:15,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:48:34,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:48:34,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:48:34,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895550281]
[2024-05-12 11:48:34,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895550281] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:48:34,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:48:34,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:48:34,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399803940]
[2024-05-12 11:48:34,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:48:34,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:48:34,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:48:34,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:48:34,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:48:34,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:48:34,721 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 132 transitions, 950 flow. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:34,721 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:48:34,721 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:48:34,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:48:38,097 INFO  L124   PetriNetUnfolderBase]: 4618/7654 cut-off events.
[2024-05-12 11:48:38,098 INFO  L125   PetriNetUnfolderBase]: For 136367/136381 co-relation queries the response was YES.
[2024-05-12 11:48:38,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35246 conditions, 7654 events. 4618/7654 cut-off events. For 136367/136381 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 50645 event pairs, 1477 based on Foata normal form. 6/7440 useless extension candidates. Maximal degree in co-relation 35196. Up to 6430 conditions per place. 
[2024-05-12 11:48:38,151 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 139 selfloop transitions, 19 changer transitions 0/181 dead transitions.
[2024-05-12 11:48:38,151 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 181 transitions, 1388 flow
[2024-05-12 11:48:38,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:48:38,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:48:38,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions.
[2024-05-12 11:48:38,152 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5343137254901961
[2024-05-12 11:48:38,152 INFO  L175             Difference]: Start difference. First operand has 120 places, 132 transitions, 950 flow. Second operand 8 states and 218 transitions.
[2024-05-12 11:48:38,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 181 transitions, 1388 flow
[2024-05-12 11:48:38,205 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 181 transitions, 1300 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-05-12 11:48:38,207 INFO  L231             Difference]: Finished difference. Result has 123 places, 132 transitions, 907 flow
[2024-05-12 11:48:38,207 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=907, PETRI_PLACES=123, PETRI_TRANSITIONS=132}
[2024-05-12 11:48:38,208 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places.
[2024-05-12 11:48:38,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 132 transitions, 907 flow
[2024-05-12 11:48:38,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:38,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:48:38,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:48:38,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-05-12 11:48:38,209 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:48:38,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:48:38,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -87244764, now seen corresponding path program 1 times
[2024-05-12 11:48:38,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:48:38,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12301063]
[2024-05-12 11:48:38,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:48:38,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:48:38,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:48:57,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:48:57,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:48:57,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12301063]
[2024-05-12 11:48:57,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12301063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:48:57,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:48:57,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:48:57,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582779969]
[2024-05-12 11:48:57,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:48:57,602 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:48:57,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:48:57,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:48:57,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:48:57,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:48:57,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 132 transitions, 907 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:57,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:48:57,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:48:57,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:49:01,481 INFO  L124   PetriNetUnfolderBase]: 4919/8023 cut-off events.
[2024-05-12 11:49:01,482 INFO  L125   PetriNetUnfolderBase]: For 146349/146349 co-relation queries the response was YES.
[2024-05-12 11:49:01,508 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37063 conditions, 8023 events. 4919/8023 cut-off events. For 146349/146349 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 52166 event pairs, 1554 based on Foata normal form. 4/7794 useless extension candidates. Maximal degree in co-relation 37011. Up to 6871 conditions per place. 
[2024-05-12 11:49:01,537 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 157 selfloop transitions, 23 changer transitions 0/192 dead transitions.
[2024-05-12 11:49:01,537 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 192 transitions, 1457 flow
[2024-05-12 11:49:01,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:49:01,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:49:01,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions.
[2024-05-12 11:49:01,539 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5163398692810458
[2024-05-12 11:49:01,539 INFO  L175             Difference]: Start difference. First operand has 123 places, 132 transitions, 907 flow. Second operand 9 states and 237 transitions.
[2024-05-12 11:49:01,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 192 transitions, 1457 flow
[2024-05-12 11:49:01,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 192 transitions, 1414 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-05-12 11:49:01,602 INFO  L231             Difference]: Finished difference. Result has 125 places, 135 transitions, 972 flow
[2024-05-12 11:49:01,602 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=972, PETRI_PLACES=125, PETRI_TRANSITIONS=135}
[2024-05-12 11:49:01,602 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 68 predicate places.
[2024-05-12 11:49:01,603 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 135 transitions, 972 flow
[2024-05-12 11:49:01,603 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:49:01,603 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:49:01,603 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:49:01,603 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-05-12 11:49:01,603 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:49:01,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:49:01,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 257128260, now seen corresponding path program 3 times
[2024-05-12 11:49:01,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:49:01,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676757290]
[2024-05-12 11:49:01,604 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:49:01,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:49:01,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:49:20,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:49:20,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:49:20,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676757290]
[2024-05-12 11:49:20,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676757290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:49:20,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:49:20,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:49:20,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220509744]
[2024-05-12 11:49:20,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:49:20,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:49:20,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:49:20,916 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:49:20,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:49:21,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:49:21,192 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 135 transitions, 972 flow. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:49:21,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:49:21,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:49:21,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:49:24,579 INFO  L124   PetriNetUnfolderBase]: 4692/7686 cut-off events.
[2024-05-12 11:49:24,579 INFO  L125   PetriNetUnfolderBase]: For 156822/156838 co-relation queries the response was YES.
[2024-05-12 11:49:24,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36928 conditions, 7686 events. 4692/7686 cut-off events. For 156822/156838 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 49890 event pairs, 1375 based on Foata normal form. 8/7502 useless extension candidates. Maximal degree in co-relation 36875. Up to 6444 conditions per place. 
[2024-05-12 11:49:24,633 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 131 selfloop transitions, 30 changer transitions 0/184 dead transitions.
[2024-05-12 11:49:24,633 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 184 transitions, 1456 flow
[2024-05-12 11:49:24,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:49:24,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:49:24,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions.
[2024-05-12 11:49:24,635 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5367647058823529
[2024-05-12 11:49:24,635 INFO  L175             Difference]: Start difference. First operand has 125 places, 135 transitions, 972 flow. Second operand 8 states and 219 transitions.
[2024-05-12 11:49:24,635 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 184 transitions, 1456 flow
[2024-05-12 11:49:24,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 184 transitions, 1372 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-05-12 11:49:24,727 INFO  L231             Difference]: Finished difference. Result has 126 places, 137 transitions, 1003 flow
[2024-05-12 11:49:24,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1003, PETRI_PLACES=126, PETRI_TRANSITIONS=137}
[2024-05-12 11:49:24,727 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places.
[2024-05-12 11:49:24,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 137 transitions, 1003 flow
[2024-05-12 11:49:24,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:49:24,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:49:24,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:49:24,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-05-12 11:49:24,728 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:49:24,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:49:24,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 257312710, now seen corresponding path program 2 times
[2024-05-12 11:49:24,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:49:24,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406466932]
[2024-05-12 11:49:24,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:49:24,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:49:24,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:49:44,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:49:44,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:49:44,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406466932]
[2024-05-12 11:49:44,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406466932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:49:44,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:49:44,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:49:44,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616591670]
[2024-05-12 11:49:44,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:49:44,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:49:44,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:49:44,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:49:44,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:49:44,268 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:49:44,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 137 transitions, 1003 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:49:44,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:49:44,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:49:44,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:49:47,950 INFO  L124   PetriNetUnfolderBase]: 5038/8090 cut-off events.
[2024-05-12 11:49:47,950 INFO  L125   PetriNetUnfolderBase]: For 174964/174966 co-relation queries the response was YES.
[2024-05-12 11:49:47,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39906 conditions, 8090 events. 5038/8090 cut-off events. For 174964/174966 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 51504 event pairs, 1283 based on Foata normal form. 6/7916 useless extension candidates. Maximal degree in co-relation 39852. Up to 6419 conditions per place. 
[2024-05-12 11:49:48,012 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 140 selfloop transitions, 72 changer transitions 0/224 dead transitions.
[2024-05-12 11:49:48,012 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 224 transitions, 2019 flow
[2024-05-12 11:49:48,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:49:48,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:49:48,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 300 transitions.
[2024-05-12 11:49:48,013 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5347593582887701
[2024-05-12 11:49:48,014 INFO  L175             Difference]: Start difference. First operand has 126 places, 137 transitions, 1003 flow. Second operand 11 states and 300 transitions.
[2024-05-12 11:49:48,014 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 224 transitions, 2019 flow
[2024-05-12 11:49:48,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 224 transitions, 1922 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-05-12 11:49:48,092 INFO  L231             Difference]: Finished difference. Result has 131 places, 146 transitions, 1232 flow
[2024-05-12 11:49:48,093 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1232, PETRI_PLACES=131, PETRI_TRANSITIONS=146}
[2024-05-12 11:49:48,093 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2024-05-12 11:49:48,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 146 transitions, 1232 flow
[2024-05-12 11:49:48,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:49:48,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:49:48,094 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:49:48,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-05-12 11:49:48,094 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:49:48,094 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:49:48,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 257306200, now seen corresponding path program 3 times
[2024-05-12 11:49:48,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:49:48,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455193429]
[2024-05-12 11:49:48,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:49:48,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:49:48,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:50:07,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:50:07,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:50:07,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455193429]
[2024-05-12 11:50:07,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455193429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:50:07,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:50:07,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:50:07,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240522642]
[2024-05-12 11:50:07,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:50:07,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:50:07,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:50:07,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:50:07,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:50:08,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:50:08,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 146 transitions, 1232 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:08,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:50:08,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:50:08,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:50:11,727 INFO  L124   PetriNetUnfolderBase]: 5084/8163 cut-off events.
[2024-05-12 11:50:11,727 INFO  L125   PetriNetUnfolderBase]: For 189434/189436 co-relation queries the response was YES.
[2024-05-12 11:50:11,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41599 conditions, 8163 events. 5084/8163 cut-off events. For 189434/189436 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 51901 event pairs, 1283 based on Foata normal form. 6/7989 useless extension candidates. Maximal degree in co-relation 41544. Up to 6458 conditions per place. 
[2024-05-12 11:50:11,790 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 143 selfloop transitions, 73 changer transitions 0/228 dead transitions.
[2024-05-12 11:50:11,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 228 transitions, 2160 flow
[2024-05-12 11:50:11,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:50:11,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:50:11,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 302 transitions.
[2024-05-12 11:50:11,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5383244206773619
[2024-05-12 11:50:11,793 INFO  L175             Difference]: Start difference. First operand has 131 places, 146 transitions, 1232 flow. Second operand 11 states and 302 transitions.
[2024-05-12 11:50:11,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 228 transitions, 2160 flow
[2024-05-12 11:50:12,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 228 transitions, 2021 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-05-12 11:50:12,006 INFO  L231             Difference]: Finished difference. Result has 136 places, 149 transitions, 1309 flow
[2024-05-12 11:50:12,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1309, PETRI_PLACES=136, PETRI_TRANSITIONS=149}
[2024-05-12 11:50:12,007 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 79 predicate places.
[2024-05-12 11:50:12,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 149 transitions, 1309 flow
[2024-05-12 11:50:12,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:12,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:50:12,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:50:12,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-05-12 11:50:12,008 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:50:12,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:50:12,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 257133220, now seen corresponding path program 4 times
[2024-05-12 11:50:12,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:50:12,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179374626]
[2024-05-12 11:50:12,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:50:12,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:50:12,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:50:31,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:50:31,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:50:31,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179374626]
[2024-05-12 11:50:31,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179374626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:50:31,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:50:31,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:50:31,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767828394]
[2024-05-12 11:50:31,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:50:31,511 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:50:31,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:50:31,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:50:31,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:50:31,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:50:31,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 149 transitions, 1309 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:31,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:50:31,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:50:31,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:50:35,453 INFO  L124   PetriNetUnfolderBase]: 5074/8149 cut-off events.
[2024-05-12 11:50:35,453 INFO  L125   PetriNetUnfolderBase]: For 193143/193145 co-relation queries the response was YES.
[2024-05-12 11:50:35,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41718 conditions, 8149 events. 5074/8149 cut-off events. For 193143/193145 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 51887 event pairs, 1281 based on Foata normal form. 6/7975 useless extension candidates. Maximal degree in co-relation 41661. Up to 6450 conditions per place. 
[2024-05-12 11:50:35,513 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 156 selfloop transitions, 74 changer transitions 0/242 dead transitions.
[2024-05-12 11:50:35,513 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 242 transitions, 2123 flow
[2024-05-12 11:50:35,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-05-12 11:50:35,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-05-12 11:50:35,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 350 transitions.
[2024-05-12 11:50:35,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5279034690799397
[2024-05-12 11:50:35,515 INFO  L175             Difference]: Start difference. First operand has 136 places, 149 transitions, 1309 flow. Second operand 13 states and 350 transitions.
[2024-05-12 11:50:35,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 242 transitions, 2123 flow
[2024-05-12 11:50:35,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 242 transitions, 1937 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-05-12 11:50:35,655 INFO  L231             Difference]: Finished difference. Result has 141 places, 149 transitions, 1279 flow
[2024-05-12 11:50:35,655 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1279, PETRI_PLACES=141, PETRI_TRANSITIONS=149}
[2024-05-12 11:50:35,656 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 84 predicate places.
[2024-05-12 11:50:35,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 149 transitions, 1279 flow
[2024-05-12 11:50:35,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:35,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:50:35,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:50:35,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-05-12 11:50:35,657 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:50:35,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:50:35,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 49536193, now seen corresponding path program 1 times
[2024-05-12 11:50:35,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:50:35,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324124531]
[2024-05-12 11:50:35,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:50:35,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:50:35,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:50:54,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:50:54,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:50:54,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324124531]
[2024-05-12 11:50:54,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324124531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:50:54,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:50:54,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:50:54,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115990072]
[2024-05-12 11:50:54,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:50:54,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:50:54,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:50:54,628 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:50:54,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:50:54,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51
[2024-05-12 11:50:54,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 149 transitions, 1279 flow. Second operand  has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:54,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:50:54,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51
[2024-05-12 11:50:54,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:50:57,827 INFO  L124   PetriNetUnfolderBase]: 4481/7421 cut-off events.
[2024-05-12 11:50:57,827 INFO  L125   PetriNetUnfolderBase]: For 197141/197196 co-relation queries the response was YES.
[2024-05-12 11:50:57,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38541 conditions, 7421 events. 4481/7421 cut-off events. For 197141/197196 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50018 event pairs, 1638 based on Foata normal form. 8/7251 useless extension candidates. Maximal degree in co-relation 38483. Up to 6287 conditions per place. 
[2024-05-12 11:50:57,880 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 132 selfloop transitions, 15 changer transitions 0/181 dead transitions.
[2024-05-12 11:50:57,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 181 transitions, 1716 flow
[2024-05-12 11:50:57,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:50:57,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:50:57,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions.
[2024-05-12 11:50:57,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5294117647058824
[2024-05-12 11:50:57,882 INFO  L175             Difference]: Start difference. First operand has 141 places, 149 transitions, 1279 flow. Second operand 6 states and 162 transitions.
[2024-05-12 11:50:57,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 181 transitions, 1716 flow
[2024-05-12 11:50:57,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1518 flow, removed 5 selfloop flow, removed 13 redundant places.
[2024-05-12 11:50:57,971 INFO  L231             Difference]: Finished difference. Result has 135 places, 158 transitions, 1230 flow
[2024-05-12 11:50:57,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1230, PETRI_PLACES=135, PETRI_TRANSITIONS=158}
[2024-05-12 11:50:57,971 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 78 predicate places.
[2024-05-12 11:50:57,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 158 transitions, 1230 flow
[2024-05-12 11:50:57,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:50:57,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:50:57,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:50:57,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-05-12 11:50:57,972 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:50:57,972 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:50:57,972 INFO  L85        PathProgramCache]: Analyzing trace with hash -1318172860, now seen corresponding path program 4 times
[2024-05-12 11:50:57,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:50:57,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039232972]
[2024-05-12 11:50:57,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:50:57,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:50:58,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:51:16,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:51:16,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:51:16,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039232972]
[2024-05-12 11:51:16,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039232972] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:51:16,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:51:16,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:51:16,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120478560]
[2024-05-12 11:51:16,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:51:16,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:51:16,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:51:16,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:51:16,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:51:16,781 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-05-12 11:51:16,782 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 158 transitions, 1230 flow. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:51:16,782 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:51:16,782 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-05-12 11:51:16,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:51:20,791 INFO  L124   PetriNetUnfolderBase]: 4884/7978 cut-off events.
[2024-05-12 11:51:20,791 INFO  L125   PetriNetUnfolderBase]: For 206975/207003 co-relation queries the response was YES.
[2024-05-12 11:51:20,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41298 conditions, 7978 events. 4884/7978 cut-off events. For 206975/207003 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 52439 event pairs, 1524 based on Foata normal form. 5/7789 useless extension candidates. Maximal degree in co-relation 41238. Up to 6691 conditions per place. 
[2024-05-12 11:51:20,869 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 145 selfloop transitions, 35 changer transitions 0/203 dead transitions.
[2024-05-12 11:51:20,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 203 transitions, 1754 flow
[2024-05-12 11:51:20,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:51:20,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:51:20,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions.
[2024-05-12 11:51:20,881 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5294117647058824
[2024-05-12 11:51:20,881 INFO  L175             Difference]: Start difference. First operand has 135 places, 158 transitions, 1230 flow. Second operand 8 states and 216 transitions.
[2024-05-12 11:51:20,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 203 transitions, 1754 flow
[2024-05-12 11:51:21,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 203 transitions, 1708 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-05-12 11:51:21,033 INFO  L231             Difference]: Finished difference. Result has 140 places, 160 transitions, 1315 flow
[2024-05-12 11:51:21,034 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1315, PETRI_PLACES=140, PETRI_TRANSITIONS=160}
[2024-05-12 11:51:21,034 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 83 predicate places.
[2024-05-12 11:51:21,034 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 160 transitions, 1315 flow
[2024-05-12 11:51:21,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:51:21,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:51:21,035 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:51:21,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-05-12 11:51:21,035 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:51:21,036 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:51:21,036 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081813050, now seen corresponding path program 5 times
[2024-05-12 11:51:21,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:51:21,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454761940]
[2024-05-12 11:51:21,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:51:21,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:51:21,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:51:42,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:51:42,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:51:42,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454761940]
[2024-05-12 11:51:42,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454761940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:51:42,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:51:42,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:51:42,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434808988]
[2024-05-12 11:51:42,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:51:42,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:51:42,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:51:42,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:51:42,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:51:42,743 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:51:42,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 160 transitions, 1315 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:51:42,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:51:42,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:51:42,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:51:46,239 INFO  L124   PetriNetUnfolderBase]: 5178/8240 cut-off events.
[2024-05-12 11:51:46,239 INFO  L125   PetriNetUnfolderBase]: For 222326/222329 co-relation queries the response was YES.
[2024-05-12 11:51:46,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43724 conditions, 8240 events. 5178/8240 cut-off events. For 222326/222329 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 52400 event pairs, 1443 based on Foata normal form. 4/8081 useless extension candidates. Maximal degree in co-relation 43663. Up to 6553 conditions per place. 
[2024-05-12 11:51:46,306 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 119 selfloop transitions, 87 changer transitions 0/218 dead transitions.
[2024-05-12 11:51:46,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 218 transitions, 2059 flow
[2024-05-12 11:51:46,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:51:46,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:51:46,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions.
[2024-05-12 11:51:46,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5294117647058824
[2024-05-12 11:51:46,307 INFO  L175             Difference]: Start difference. First operand has 140 places, 160 transitions, 1315 flow. Second operand 9 states and 243 transitions.
[2024-05-12 11:51:46,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 218 transitions, 2059 flow
[2024-05-12 11:51:46,435 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 218 transitions, 1946 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-05-12 11:51:46,437 INFO  L231             Difference]: Finished difference. Result has 143 places, 163 transitions, 1438 flow
[2024-05-12 11:51:46,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1438, PETRI_PLACES=143, PETRI_TRANSITIONS=163}
[2024-05-12 11:51:46,438 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2024-05-12 11:51:46,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 163 transitions, 1438 flow
[2024-05-12 11:51:46,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:51:46,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:51:46,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:51:46,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-05-12 11:51:46,439 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:51:46,439 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:51:46,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -1317988410, now seen corresponding path program 6 times
[2024-05-12 11:51:46,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:51:46,439 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647208958]
[2024-05-12 11:51:46,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:51:46,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:51:46,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:52:05,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:52:05,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:52:05,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647208958]
[2024-05-12 11:52:05,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647208958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:52:05,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:52:05,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:52:05,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926297065]
[2024-05-12 11:52:05,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:52:05,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:52:05,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:52:05,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:52:05,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:52:05,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:52:05,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 163 transitions, 1438 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:52:05,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:52:05,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:52:05,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:52:09,589 INFO  L124   PetriNetUnfolderBase]: 5280/8437 cut-off events.
[2024-05-12 11:52:09,589 INFO  L125   PetriNetUnfolderBase]: For 237274/237277 co-relation queries the response was YES.
[2024-05-12 11:52:09,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45542 conditions, 8437 events. 5280/8437 cut-off events. For 237274/237277 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 54109 event pairs, 1445 based on Foata normal form. 4/8263 useless extension candidates. Maximal degree in co-relation 45480. Up to 6639 conditions per place. 
[2024-05-12 11:52:09,655 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 143 selfloop transitions, 88 changer transitions 0/243 dead transitions.
[2024-05-12 11:52:09,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 243 transitions, 2490 flow
[2024-05-12 11:52:09,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:52:09,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:52:09,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 300 transitions.
[2024-05-12 11:52:09,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5347593582887701
[2024-05-12 11:52:09,656 INFO  L175             Difference]: Start difference. First operand has 143 places, 163 transitions, 1438 flow. Second operand 11 states and 300 transitions.
[2024-05-12 11:52:09,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 243 transitions, 2490 flow
[2024-05-12 11:52:09,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 243 transitions, 2288 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-05-12 11:52:09,774 INFO  L231             Difference]: Finished difference. Result has 148 places, 169 transitions, 1540 flow
[2024-05-12 11:52:09,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1540, PETRI_PLACES=148, PETRI_TRANSITIONS=169}
[2024-05-12 11:52:09,775 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 91 predicate places.
[2024-05-12 11:52:09,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 169 transitions, 1540 flow
[2024-05-12 11:52:09,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:52:09,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:52:09,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:52:09,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-05-12 11:52:09,775 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:52:09,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:52:09,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1317994920, now seen corresponding path program 7 times
[2024-05-12 11:52:09,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:52:09,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396473023]
[2024-05-12 11:52:09,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:52:09,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:52:09,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:52:30,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:52:30,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:52:30,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396473023]
[2024-05-12 11:52:30,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396473023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:52:30,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:52:30,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:52:30,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189838552]
[2024-05-12 11:52:30,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:52:30,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:52:30,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:52:30,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:52:30,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:52:30,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-05-12 11:52:30,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 169 transitions, 1540 flow. Second operand  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:52:30,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:52:30,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-05-12 11:52:30,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:52:34,127 INFO  L124   PetriNetUnfolderBase]: 5326/8519 cut-off events.
[2024-05-12 11:52:34,128 INFO  L125   PetriNetUnfolderBase]: For 248086/248089 co-relation queries the response was YES.
[2024-05-12 11:52:34,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45976 conditions, 8519 events. 5326/8519 cut-off events. For 248086/248089 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 54941 event pairs, 1454 based on Foata normal form. 4/8345 useless extension candidates. Maximal degree in co-relation 45913. Up to 6678 conditions per place. 
[2024-05-12 11:52:34,201 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 145 selfloop transitions, 90 changer transitions 0/247 dead transitions.
[2024-05-12 11:52:34,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 247 transitions, 2547 flow
[2024-05-12 11:52:34,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:52:34,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:52:34,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 302 transitions.
[2024-05-12 11:52:34,203 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5383244206773619
[2024-05-12 11:52:34,203 INFO  L175             Difference]: Start difference. First operand has 148 places, 169 transitions, 1540 flow. Second operand 11 states and 302 transitions.
[2024-05-12 11:52:34,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 247 transitions, 2547 flow
[2024-05-12 11:52:34,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 247 transitions, 2327 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-05-12 11:52:34,371 INFO  L231             Difference]: Finished difference. Result has 151 places, 172 transitions, 1565 flow
[2024-05-12 11:52:34,371 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1565, PETRI_PLACES=151, PETRI_TRANSITIONS=172}
[2024-05-12 11:52:34,372 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 94 predicate places.
[2024-05-12 11:52:34,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 172 transitions, 1565 flow
[2024-05-12 11:52:34,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:52:34,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:52:34,372 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:52:34,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-05-12 11:52:34,373 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:52:34,373 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:52:34,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -1410400472, now seen corresponding path program 8 times
[2024-05-12 11:52:34,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:52:34,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525878927]
[2024-05-12 11:52:34,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:52:34,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:52:34,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15